{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T09:09:40Z","timestamp":1652951380811},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T00:00:00Z","timestamp":1267488000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s00373-010-0909-x","type":"journal-article","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T05:50:02Z","timestamp":1267422602000},"page":"433-456","source":"Crossref","is-referenced-by-count":6,"title":["Structural Properties and Hamiltonicity of Neighborhood Graphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Ingo","family":"Schiermeyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Sonntag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanns-Martin","family":"Teichert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,2]]},"reference":[{"key":"909_CR1","unstructured":"Acharya, B.D., Vartak, M.N.: Open neighborhood graphs. Indian Institute of Technology, Department of Mathematics. Research Report No. 7, Bombay (1973)"},{"key":"909_CR2","first-page":"101","volume":"12","author":"J.W. Boland","year":"1987","unstructured":"Boland J.W., Brigham R.C., Dutton R.D.: Embedding arbitrary graphs in neighborhood graphs. J. Comb. Inf. Syst. Sci. 12, 101\u2013112 (1987)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"909_CR3","first-page":"151","volume":"58","author":"J.W. Boland","year":"1987","unstructured":"Boland J.W., Brigham R.C., Dutton R.D.: The difference between a neighborhood graph and a wheel. Congr. Numerantium 58, 151\u2013156 (1987)","journal-title":"Congr. Numerantium"},{"key":"909_CR4","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0095-8956(71)90016-5","volume":"11","author":"J.A. Bondy","year":"1971","unstructured":"Bondy J.A.: Pancyclic graphs. J. Comb. Theor. Ser. B 11, 80\u201384 (1971)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"909_CR5","first-page":"75","volume":"12","author":"R.C. Brigham","year":"1987","unstructured":"Brigham R.C., Dutton R.D.: On neighborhood graphs. J. Comb. Inf. Syst. Sci. 12, 75\u201385 (1987)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"909_CR6","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel R.: Graph Theory, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"key":"909_CR7","first-page":"52","volume":"5","author":"G. Exoo","year":"1980","unstructured":"Exoo G., Harary F.: Step graphs. J. Comb. Inf. Syst. Sci. 5, 52\u201353 (1980)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"909_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1137\/S0895480191197234","volume":"8","author":"K.F. Fraughnaugh","year":"1995","unstructured":"Fraughnaugh K.F., Lundgren J.R., Merz S.K., Maybee J.S., Pullman N.J.: Competition graphs of strongly connected and hamiltonian digraphs. SIAM. J. Discret. Math. 8, 179\u2013185 (1995)","journal-title":"SIAM. J. Discret. Math."},{"key":"909_CR9","first-page":"33","volume":"8","author":"H.J. Greenberg","year":"1983","unstructured":"Greenberg H.J., Lundgren J.R., Maybee J.S.: The inversion of 2-step graphs. J. Comb. Inf. Syst. Sci. 8, 33\u201343 (1983)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"909_CR10","doi-asserted-by":"crossref","unstructured":"Kim, S.R.: The competition number and its variants. In: Gimbel, J., Kennedy, J.W., Quintas, L.V. (eds.) Quo Vadis, Graph Theory? Ann. Discret. Math. 55, 313\u2013326 (1993)","DOI":"10.1016\/S0167-5060(08)70396-0"},{"key":"909_CR11","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/978-1-4684-6381-1_9","volume-title":"Applications of Combinatorics and Graph Theory to the Biological and Social Sciences, IMA, vol. 17","author":"J.R. Lundgren","year":"1989","unstructured":"Lundgren J.R.: Food webs, competition graphs, competition-common enemy graphs and niche graphs. In: Roberts, F. (eds) Applications of Combinatorics and Graph Theory to the Biological and Social Sciences, IMA, vol. 17, pp. 221\u2013243. Springer, New York (1989)"},{"key":"909_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0024-3795(94)00173-B","volume":"217","author":"J.R. Lundgren","year":"1995","unstructured":"Lundgren J.R., Merz S.K., Maybee J.S., Rasmussen C.W.: A characterization of graphs with internal two-step graphs. Linear Algebra Appl. 217, 203\u2013223 (1995)","journal-title":"Linear Algebra Appl."},{"key":"909_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0024-3795(94)00227-5","volume":"217","author":"J.R. Lundgren","year":"1995","unstructured":"Lundgren J.R., Merz S.K., Rasmussen C.W.: Chromatic numbers of competition graphs. Linear Algebra Appl. 217, 225\u2013239 (1995)","journal-title":"Linear Algebra Appl."},{"key":"909_CR14","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0012-365X(93)90122-A","volume":"119","author":"J.R. Lundgren","year":"1993","unstructured":"Lundgren J.R., Rasmussen C.: Two-step graphs of trees. Discret. Math. 119, 123\u2013139 (1993)","journal-title":"Discret. Math."},{"key":"909_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0012-365X(93)90121-9","volume":"119","author":"J.R. Lundgren","year":"1993","unstructured":"Lundgren J.R., Rasmussen C.W., Maybee J.S.: Interval competition graphs of symmetric digraphs. Discret. Math. 119, 113\u2013122 (1993)","journal-title":"Discret. Math."},{"key":"909_CR16","first-page":"33","volume":"52","author":"M.M. Miller","year":"1999","unstructured":"Miller M.M., Brigham R.C., Dutton R.D.: An equation involving the neighborhood (two step) and line graphs. Ars. Comb. 52, 33\u201350 (1999)","journal-title":"Ars. Comb."},{"key":"909_CR17","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O. Ore","year":"1960","unstructured":"Ore O.: A note on hamiltonian circuits. Am. Math. Mon. 67, 55 (1960)","journal-title":"Am. Math. Mon."},{"key":"909_CR18","unstructured":"Pf\u00fctzenreuter, M.: Konkurrenzgraphen von ungerichteten Graphen. Bachelor thesis, University of L\u00fcbeck, L\u00fcbeck (2006)"},{"key":"909_CR19","unstructured":"Roberts, F.S.: Competition graphs and phylogeny graphs. In: Lov\u00e1sz L. (ed.) Graph Theory and Combinatiorial Biology. Proceedings of International Colloquium Balatonlelle, 1996, Bolyai Society of Mathematical Studies, vol. 7, pp. 333\u2013362. Budapest (1999)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0909-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0909-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0909-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:30Z","timestamp":1559055510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0909-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,2]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["909"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0909-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,2]]}}}