{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T20:29:58Z","timestamp":1786998598296,"version":"build-2736575974"},"reference-count":200,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6010,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0012-365x(96)00045-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"87-147","source":"Crossref","is-referenced-by-count":145,"title":["Claw-free graphs \u2014 A survey"],"prefix":"10.1016","volume":"164","author":[{"given":"Ralph","family":"Faudree","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evelyne","family":"Flandrin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zden\u011bk","family":"Ryj\u00e1\u010dek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00045-3_BIB1","unstructured":"A. Ainouche, Hamiltonian and traceable claw-free graphs, preprint."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB2","first-page":"110","article-title":"Remarks on hamiltonian properties of claw-free graphs","volume":"29C","author":"Ainouche","year":"1990","journal-title":"Ars. Combin."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190090103","article-title":"Factors and factorizations of graphs \u2014 a survey","volume":"9","author":"Akiyama","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0012-365X(78)90105-X","article-title":"On domination and independent domination numbers of a graph","volume":"23","author":"Allan","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579196","article-title":"The monotone circuit complexity of boolean functions","volume":"7","author":"Alon","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB6","first-page":"19","article-title":"Some local conditions of hamiltonicity and pancyclicity of a graph","volume":"91","author":"Ambartsumian","year":"1990","journal-title":"Dokl. Akad. Nauk Armenii"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB7","unstructured":"A.S. Asratian, H.J. Broersma, J. Van den Heuvel and H.J. Veldman, On graphs satisfying a local Ore-type condition, preprint."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0095-8956(90)90032-U","article-title":"Some localization theorems on hamiltonian circuits","volume":"49","author":"Asratian","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB9","first-page":"71","article-title":"Chordal graphs and some of their derived graphs","volume":"53","author":"Balakrishnan","year":"1986"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB10","doi-asserted-by":"crossref","DOI":"10.1016\/0012-365X(94)00153-6","article-title":"Dominating cycles in bipartite biclaw-free graphs","author":"Barraez","year":"1991"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(91)90468-H","article-title":"Hamilton properties of graphs with large neighborhood unions","volume":"96","author":"Bauer","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB12","article-title":"Forbidden subgraph and minimum degree conditions for hamiltonicity","author":"Bedrossian","year":"1991"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0012-365X(93)90476-A","article-title":"A generalization of Fan's condition for hamiltonicity, pancyclicity and hamiltonian connectedness","volume":"115","author":"Bedrossian","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB14","article-title":"Derived graphs and digraphs","author":"Beineke","year":"1968"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0021-9800(70)80019-9","article-title":"Characterizations of derived graphs","volume":"9","author":"Beineke","year":"1970","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB16","article-title":"Etude des stables dans les graphes quasi adjoints","author":"Ben Rebea","year":"1981"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(81)90048-X","article-title":"The edge hamiltonian path problem is NP-complete","volume":"13","author":"Bertossi","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB18","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190030306","article-title":"Graph-theoretic parameters concerning domination, independence and irredundance","volume":"3","author":"Bollob\u00e1s","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB19","series-title":"Basic graph theory: paths and circuits","author":"Bondy","year":"1992"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB20","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB21","series-title":"Sufficient conditions for hamiltonicity and traceability of K1,3-free graphs","author":"Broersma","year":"1986"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB22","first-page":"5","article-title":"Subgraph conditions for dominating circuits in graphs and pancyclicity of line graphs","volume":"23","author":"Broersma","year":"1987","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB23","article-title":"Hamilton cycles and related topics","author":"Broersma","year":"1988"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01195323","article-title":"Long paths and cycles in tough graphs","volume":"9","author":"Broersma","year":"1993","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB25","article-title":"Cycles through particular subgraphs of claw-free graphs","volume":"1097","author":"Broersma","year":"1992"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB26","article-title":"Toughness and hamiltonicity in almost claw-free graphs","volume":"1114","author":"Broersma","year":"1993"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB27","series-title":"Unifying results on hamiltonian claw-free graphs","author":"Broersma","year":"1994"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB28","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1002\/jgt.3190110314","article-title":"3-connected line graphs of triangular graphs are panconnected and 1-hamiltonian","volume":"11","author":"Broersma","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB29","series-title":"Contemporary methods in Graph Theory","first-page":"181","article-title":"Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity of K1,3-free graphs","author":"Broersma","year":"1990"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB30","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0012-365X(93)90533-Y","article-title":"A note on K4-closures in hamiltonian graph theory","volume":"121","author":"Broersma","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB31","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF02760528","article-title":"A note on locally connected and hamiltonian-connected graphs","volume":"33","author":"Chartrand","year":"1979","journal-title":"Israel J. Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB32","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/1385-7258(73)90007-3","article-title":"The existence of 1-factors in line graphs, squares, and total graphs","volume":"35","author":"Chartrand","year":"1973","journal-title":"Indag. Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB33","unstructured":"G. Chen and R.H. Schelp, Hamiltonicity for K1,r-free graphs, preprint."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB34","first-page":"151","article-title":"Hamilton property on 2-order neighbour connected K1,3-free graphs","author":"Chen","year":"1994"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB35","first-page":"473","article-title":"Hamilton cycle and dominating cycle in k-connected claw-free graphs","volume":"22","author":"Chen","year":"1991","journal-title":"Nei Mongol Daxue Xuebao Ziran Kexue"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB36","first-page":"38","article-title":"Extendable cycles in N2-locally connected claw-free graphs","volume":"27","author":"Chen","year":"1991","journal-title":"J. Nanjing Univ. Natur. Sci., Spec."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB37","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1093\/qmath\/28.3.257","article-title":"Chromatic bounds for a class of graphs","volume":"228","author":"Choudum","year":"1977","journal-title":"Quart J. Math. Oxford Ser."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB38","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/jgt.3190150304","article-title":"Regular factors in K1,3-free graphs","volume":"15","author":"Choudum","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB39","series-title":"A tribute to Paul Erd\u00f6s 97-104","article-title":"On graphs not containing prescribed induced subgraphs","author":"Chung","year":"1990"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB40","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and hamiltonian circuits","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB41","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0166-218X(93)90221-9","article-title":"Which claw-free graphs are perfectly orderable?","volume":"44","author":"Chv\u00e1tal","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB42","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","article-title":"A note on hamiltonian circuits","volume":"2","author":"Chv\u00e1tal","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB43","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/0095-8956(88)90085-8","article-title":"Recognizing claw-free perfect graphs","volume":"44","author":"Chv\u00e1tal","year":"1988","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB44","first-page":"199","article-title":"Hamiltonian properties of connected locally connected graphs","volume":"32","author":"Clark","year":"1981"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB45","first-page":"303-3-7","article-title":"Circumferences of k-regular 2-connected K1,3-free graphs","volume":"12","author":"Dang","year":"1991","journal-title":"J. Northeast. Univ. Tech."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB46","first-page":"93","article-title":"Circumference of a K1,3-free graph and D.R. Woodall's conjecture","volume":"27","author":"Dang","year":"1991","journal-title":"J. Nanjing Univ. Nat. Sci., Spec. Issue on Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB47","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0166-218X(93)90032-J","article-title":"Stability number of bull-and chair-free graphs","volume":"41","author":"De Simone","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB48","first-page":"193","article-title":"A survey of results on a graph with specified hereditary properties","volume":"20B","author":"Diny","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(89)90002-6","article-title":"On the chromatic number of a graph with two forbidden subgraphs","volume":"46","author":"Dhurandhar","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB50","series-title":"The Theory and Applications of Graphs","first-page":"297","article-title":"Forbidden subgraphs and the hamiltonian theme","author":"Duffus","year":"1981"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB51","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB52","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/jgt.3190150310","article-title":"Regular factors in K1,n-free graphs","volume":"15","author":"Egawa","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB53","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/jgt.3190120317","article-title":"Claw-free graphs are edge-reconstructible","volume":"12","author":"Ellingham","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB54","series-title":"Proc. 6th Interna. Conf. on Theory and Applications of Graphs","first-page":"467","article-title":"Hamiltonian properties and adjacency conditions in K(1,3)-free graphs","volume":"1","author":"Faudree","year":"1991"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB55","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1002\/jgt.3190190312","article-title":"Generalized degree conditions for graphs with bounded independence number","volume":"19","author":"Faudree","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB56","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0012-365X(93)E0193-8","article-title":"Degree conditions and cycle extendability","volume":"141","author":"Faudree","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB57","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0012-365X(92)90035-E","article-title":"On independent generalized degrees and independence numbers in K(1,m)-free graphs","volume":"103","author":"Faudree","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB58","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02651085","article-title":"A generalization of Dirac's theorem for K(1,3)-free graphs","volume":"24","author":"Faudree","year":"1992","journal-title":"Periodica Math. Hungar."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB59","first-page":"109","article-title":"Forbidden subgraphs and cycle extendability","volume":"19","author":"Faudree","year":"1995","journal-title":"J. Comb. Math. Comb. Comp."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB60","unstructured":"R. Faudree, Z. Ryj\u00e1\u010dek and I. Schiermeyer, Local connectivity and cycle extension in claw-free graphs, Ars Combin. to appear."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB61","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1002\/jgt.3190100402","article-title":"Stability, domination and irredundance in a graph","volume":"10","author":"Favaron","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB62","article-title":"Shortest walks in almost claw-free graphs","author":"Favaron","year":"1993"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB63","series-title":"Graph Theory with Applications to Algorithms and Computer Science","first-page":"301","article-title":"On n-domination, n-dependence and forbidden subgraphs","author":"Fink","year":"1985"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB64","article-title":"Cycles hamiltoniens et dominants dans le carr\u00e9 d'un graphe connexe","author":"Flandrin","year":"1985"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB65","article-title":"Graphes sans K1,3 et probl\u00e8mes annexes","author":"Flandrin","year":"1990"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB66","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0012-365X(93)90157-O","article-title":"On hamiltonian claw-free graphs","volume":"111","author":"Flandrin","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB67","article-title":"Hamiltonism in bipartite biclaw-free graphs","author":"Flandrin","year":"1991"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB68","article-title":"Pancyclism in K1,3-free graphs","author":"Flandrin","year":"1986"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB69","series-title":"Graph Theory in Memory of G.A. Dirac","first-page":"131","article-title":"Circumference and hamiltonism in K1,3-free graphs","volume":"vol. 41","author":"Flandrin","year":"1989"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB70","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0012-365X(91)90094-I","article-title":"Hamiltonism, degree sum and neighborhood intersections","volume":"90","author":"Flandrin","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB71","article-title":"Further result on neighbourhood intersections","author":"Flandrin","year":"1988"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB72","article-title":"Chv\u00e1tal-Erd\u00f6s condition in 3-connected claw-free graphs","author":"Flandrin","year":"1989"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB73","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/net.3230240305","article-title":"Mengerian properties, hamiltonism and claw-free graphs","volume":"24","author":"Flandrin","year":"1994","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB74","first-page":"77","article-title":"Hamiltonism and claws","volume":"29C","author":"Flandrin","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB75","article-title":"Hamiltonism and vertices with a common neighbor","author":"Flandrin","year":"1991"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB76","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1006\/jctb.1993.1052","article-title":"A strengthening of Ben Rebea's lemma","volume":"59","author":"Fouquet","year":"1993","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB77","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/jgt.3190100316","article-title":"A new sufficient condition for hamiltonian graphs","volume":"10","author":"Fraisse","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB78","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/jgt.3190170106","article-title":"A note on the characterization of domination perfect graphs","volume":"17","author":"Fulman","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB79","series-title":"On claw-free M-oriented kernel-imperfect graphs","author":"Galeana-S\u00e1nchez","year":"1992"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB80","first-page":"165","article-title":"Forbidden and unavoidable subgraphs","volume":"27","author":"Gernert","year":"1989","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB81","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB82","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(81)90033-2","article-title":"On stable set polyhedra for K1,3-free graphs","volume":"31","author":"Giles","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB83","first-page":"161","article-title":"The strong perfect graph theorem for a class of partitionable graphs","volume":"21","author":"Giles","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB84","first-page":"193","article-title":"The binding number of trees and K(1,3)-free graphs","volume":"7","author":"Goddard","year":"1990","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB85","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0095-8956(74)90061-6","article-title":"Sufficient conditions for a graph to be hamiltonian","volume":"16","author":"Goodman","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB86","article-title":"Traceability in graphs","author":"Gould","year":"1979"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB87","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/jgt.3190150204","article-title":"Updating the Hamiltonian problem \u2014 a survey","volume":"15","author":"Gould","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB88","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(82)90216-3","article-title":"Forbidden subgraphs and hamiltonian properties of graphs","volume":"42","author":"Gould","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB89","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/jgt.3190080117","article-title":"Forbidden subgraphs and Hamiltonian properties in the square of a connected graph","volume":"8","author":"Gould","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB90","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0095-8956(90)90079-F","article-title":"On the numbers of independent k-sets in a claw-free graph","volume":"50","author":"Hamidoune","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB91","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0095-8956(85)90089-9","article-title":"Stability in CAN-free graphs","volume":"38","author":"Hammer","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB92","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02579377","article-title":"The structure of a graph: application to CN-free graphs","volume":"5","author":"Hammer","year":"1985","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB93","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1112\/S0025579300008494","article-title":"Trees with hamiltonian square","volume":"18","author":"Harary","year":"1971","journal-title":"Mathematika"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB94","first-page":"205","article-title":"Recent results and open problems in domination theory","author":"Hedetniemi","year":"1988"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB95","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1002\/jgt.3190090415","article-title":"The square of a connected S(K1,3)-free graph is vertex pancyclic","volume":"9","author":"Hendry","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB96","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(90)90163-C","article-title":"Extending cycles in graphs","volume":"85","author":"Hendry","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB97","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/jgt.3190170107","article-title":"On the stability number of AH-free graphs","volume":"17","author":"Hertz","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB98","first-page":"189","article-title":"How to color claw-free perfect graphs","volume":"11","author":"Hsu","year":"1981","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB99","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(81)90218-1","article-title":"Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs","volume":"37","author":"Hsu","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB100","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0012-365X(82)90169-8","article-title":"A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs","volume":"28","author":"Hsu","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB101","first-page":"357","article-title":"Algorithms for maximum weight cliques, minimum weighted clique covers and minimum colorings of claw-free perfect graphs","volume":"21","author":"Hsu","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB102","unstructured":"Z. Hu, A proof of Broersma and Veldman's conjectures, preprint, Huazhong Normal University."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB103","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0095-8956(80)90042-8","article-title":"Hamilton cycles in regular 2-connected graphs","volume":"29","author":"Jackson","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB104","first-page":"87","article-title":"Concerning the circumference of certain families of graphs","volume":"1076","author":"Jackson","year":"1992"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB105","first-page":"145","article-title":"A characterization of 3\/2-tough graphs","volume":"38","author":"Jackson","year":"1994","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB106","first-page":"135","article-title":"K-walks of graphs","volume":"2","author":"Jackson","year":"1990","journal-title":"Australas. J. Combin."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB107","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/jgt.3190040303","article-title":"A note on Choundum's chromatic bounds for a class of graphs","volume":"4","author":"Javdekar","year":"1980","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB108","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB109","series-title":"Recent Advances in Graph Theory","first-page":"315","article-title":"Note on hamiltonian graphs","author":"Jung","year":"1975"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB110","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1002\/jgt.3190090416","article-title":"On partitioning the edges of graphs into connected graphs","volume":"9","author":"J\u00fcnger","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB111","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/jgt.3190080302","article-title":"Connected, locally 2-connected K1,3-free graphs are panconnected","volume":"8","author":"Kanetkar","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB112","doi-asserted-by":"crossref","first-page":"295","DOI":"10.4153\/CMB-1968-037-0","article-title":"On the cube of a graph","volume":"11","author":"Karaganis","year":"1969","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB113","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0095-8956(84)90022-4","article-title":"On the chromatic index of multigraphs without large triangles","volume":"6","author":"Kierstead","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB114","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0012-365X(89)90203-3","article-title":"Applications of edge coloring of multigraphs to vertex colorings of graphs","volume":"74","author":"Kierstead","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB115","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0012-365X(83)90043-2","article-title":"Some applications of Vizing's theorem to vertex colorings of graphs","volume":"45","author":"Kierstead","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB116","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(86)90142-1","article-title":"The chromatic number of graphs which induce neither K1,3 nor K5 - e","volume":"58","author":"Kierstead","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB117","first-page":"11","article-title":"Centers in line graphs","volume":"43","author":"Knor","year":"1993","journal-title":"Math. Slovaca"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB118","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0095-8956(90)90033-V","article-title":"A note on the edge-reconstruction of K1,3-free graphs","volume":"49","author":"Krasikov","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB119","first-page":"257","article-title":"A note on matchings in graphs","volume":"17","author":"Las Vergnas","year":"1975","journal-title":"Cahiers Centre Etudes Rech. Op\u00e9r."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB120","unstructured":"Guojun Li, Zhenhong Liu and Mei Lu, Hamiltonian cycle in 3-connected claw-free graph, preprint."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB121","unstructured":"Hao Li, Hamiltonian cycles in 2-connected claw-free graphs, preprint."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB122","first-page":"119","volume":"1076","author":"Li","year":"1992"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB123","series-title":"Hamiltonicity in 2-connected graphs with claws","author":"Li","year":"1993"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB124","series-title":"Degree sums, claws, and hamiltonicity","author":"Li","year":"1994"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB125","first-page":"109","article-title":"Neighborhood conditions for claw-free hamiltonian graphs","volume":"29A","author":"Li","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB126","first-page":"98","article-title":"A note on circumferences of 3-connected claw-free graph","volume":"27","author":"Li","year":"1991","journal-title":"J. Nanjing Univ. Nat. Sci."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB127","first-page":"123","article-title":"Pancyclism in claw-free graphs","volume":"27","author":"Li","year":"1991","journal-title":"J. Nanjing Univ. Nat. Sci."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB128","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/jgt.3190170305","article-title":"Hamiltonian cycles in 3-connected claw-free graphs","volume":"17","author":"Li","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB129","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0012-365X(93)E0142-Q","article-title":"Longest cycles in regular 2-connected claw-free graphs","volume":"137","author":"Li","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB130","unstructured":"Mingchu Li, Hamiltonicity in N2-locally connected claw-free graphs, preprint."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB131","unstructured":"Mingchu Li, On pancyclic claw-free graphs, preprint."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB132","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/jgt.3190170305","article-title":"Hamiltonian cycles in 3-connected and K1,3-free graphs","volume":"17","author":"Li","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB133","first-page":"223","article-title":"Hamilton problems in claw-free graphs \u2014 a survey","volume":"27","author":"Li","year":"1991","journal-title":"J. Nanjing Univ. Nat. Sci."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB134","first-page":"10","article-title":"The maximum number of diagonals of cycles in claw-free graphs","volume":"18","author":"Liu","year":"1989","journal-title":"Shanghai Shifan Daxue Xuebao Ziran Kexue Ban"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB135","first-page":"105","article-title":"Some results on longest paths and cycles in K1,3-free graphs","volume":"4","author":"Liu","year":"1986","journal-title":"J. Changsha Railway Inst."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB136","author":"Liu","year":"1987"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB137","first-page":"36","article-title":"2-connected, k-regular graphs on at most 3k + 3 vertices to be hamiltonian","volume":"6","author":"Liu","year":"1986","journal-title":"J. Systems Sci. Math. Sci."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB138","doi-asserted-by":"crossref","first-page":"120","DOI":"10.21136\/CMJ.1991.102441","article-title":"Factors of claw-free graphs","volume":"41","author":"Lonc","year":"1991","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB139","series-title":"Perfect Graphs","first-page":"56","author":"Lov\u00e1sz","year":"1983"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB140_1","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB140_2","volume":"29","author":"Lov\u00e1sz","year":"1986","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB141","unstructured":"L.R. Markus, Disjoint Cycles in claw-free graphs, preprint."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB142","first-page":"143","article-title":"Hamiltonian results in K1,r-free graphs","volume":"98","author":"Markus","year":"1993"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB143","unstructured":"L.R. Markus and H.S. Snevily, Disjoint cycles in star-free graphs, preprint."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB144","first-page":"49","article-title":"Extremal results for K1,3-free graphs","volume":"49","author":"Matthews","year":"1985"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB145","first-page":"77","article-title":"A technique for algorithms in K1,3-free graphs","volume":"69","author":"Matthews","year":"1989"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB146","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190080116","article-title":"Hamiltonian results in K1,3-free graphs","volume":"8","author":"Matthews","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB147","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jgt.3190090208","article-title":"Longest paths and cycles in K1,3-free graphs","volume":"9","author":"Matthews","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB148","unstructured":"J.F. Maurras, Polytopes \u00e0 sommets dans {0,1}, Th\u00e8se de Doctorat d'Etat, Universit\u00e9 Paris 7."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB149","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","article-title":"On maximal independent sets of vertices in claw-free graphs","volume":"28","author":"Minty","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB150","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1002\/jgt.3190020308","article-title":"Some sufficient conditions for the existence of a 1-factor","volume":"2","author":"Nebesk\u00fd","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB151","doi-asserted-by":"crossref","first-page":"349","DOI":"10.21136\/CMJ.1979.101617","article-title":"On the existence of 1-factors in partial squares of graphs","volume":"29","author":"Nebesk\u00fd","year":"1979","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB152","unstructured":"T. Nishimura, Regular factors of line graphs II, preprint."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB153","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/jgt.3190030405","article-title":"Every connected, locally connected nontrivial graph with no induced claw is hamiltonian","volume":"3","author":"Oberly","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB154","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","article-title":"Paw-free graphs","volume":"28","author":"Olariu","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB155","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(89)90019-1","article-title":"The strong perfect graph conjecture for pan-free graphs","volume":"47","author":"Olariu","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB156","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0095-8956(76)80005-6","article-title":"The strong perfect graph conjecture is true for K1,3-free graphs","volume":"21","author":"Parthasarathy","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB157","first-page":"57","article-title":"On graphs admitting spanning eulerian subgraphs","volume":"24","author":"Paulraja","year":"1987","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB158","first-page":"307","article-title":"A note on stable sets and coloring of graphs","volume":"15","author":"Poljak","year":"1974","journal-title":"Comment. Math. Univ. Carolin."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB159","first-page":"9","article-title":"Claw-free maximal planar graphs","volume":"72","author":"Plummer","year":"1990"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB160","series-title":"Proc. 13th British Combinatorial Conf.","article-title":"Extending matchings in claw-free graphs","author":"Plummer","year":"1991"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB161","series-title":"2-extendability and hamiltonicity in two classes of claw-free graphs","author":"Plummer","year":"1992"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB162","first-page":"574","article-title":"3-connected, locally connected claw-free graphs are panconnected","volume":"6","author":"Xiong Ping Qian","year":"1991","journal-title":"Gaoxiao Yingyong Shuxue Xuebao"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB163","first-page":"137","article-title":"Factors and circuits in K1,3-free graphs","volume":"Vol. 25","author":"Ryj\u00e1\u010dek","year":"1989"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB164","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1002\/jgt.3190140305","article-title":"Hamiltonian circuits in N2-locally connected K1,3-free graphs","volume":"14","author":"Ryj\u00e1\u010dek","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB165","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/jgt.3190180505","article-title":"Almost claw-free graphs","volume":"18","author":"Ryj\u00e1\u010dek","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB166","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0012-365X(94)00292-Q","article-title":"Hamiltonicity in claw-free graphs through induced bulls","volume":"140","author":"Ryj\u00e1\u010dek","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB167","series-title":"On the independence number in K1,r+1-free graphs","author":"Ryj\u00e1\u010dek","year":"1993"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB168","series-title":"Matching extension in K1,r-free graphs with independent claw centers","author":"Ryj\u00e1\u010dek","year":"1994"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB169","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"Algorithmes de recherche d'un stable de cardinalite maximum dans un graphe sans etoile","volume":"29","author":"Sbihi","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB170","series-title":"Graph Theory, Combinatorics, Algorithms and Applications","first-page":"427","article-title":"Neighborhood intersections and Hamiltonicity","author":"Schiermeyer","year":"1991"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB171","doi-asserted-by":"crossref","first-page":"290","DOI":"10.21136\/CPM.1981.118102","article-title":"Local properties of graphs (Czech)","volume":"106","author":"Sedl\u00e1\u010dek","year":"1981","journal-title":"\u010cas. P\u011bst. Mat."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB172","first-page":"137","article-title":"On an ordering of the set of vertices of a connected graph","author":"Sekanina","year":"1960","journal-title":"Spisy Prirod. Fak. Univ. Brno"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB173","article-title":"Claws","author":"Shepherd","year":"1987"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB174","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0095-8956(91)90074-T","article-title":"Hamiltonicity in claw-free graphs","volume":"53","author":"Shepherd","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB175","series-title":"Hamiltonicity of k-connected graphs with claws","author":"Shen","year":"1994"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB176","first-page":"427","article-title":"Connected and locally connected graphs with no induced claws are vertex pancyclic","volume":"31","author":"Rong","year":"1986","journal-title":"Kexue Tongbao"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB177","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1002\/jgt.3190160310","article-title":"2-neighborhoods and hamiltonian conditions","volume":"16","author":"Rong Hua Shi","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB178","unstructured":"\u013d. \u0160olt\u00e9s, Forbidden induced subgraphs for line graphs, preprint."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB179","first-page":"427","article-title":"Neighborhoods in line graphs","volume":"42","author":"\u0160olt\u00e9s","year":"1992","journal-title":"Math. Slovaca"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB180","first-page":"8","article-title":"Graphs with 1-factors","volume":"42","author":"Sumner","year":"1974"},{"issue":"2","key":"10.1016\/S0012-365X(96)00045-3_BIB181","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1112\/jlms\/s2-13.2.351","article-title":"1-factors and antifactor sets","volume":"13","author":"Sumner","year":"1976","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB182","series-title":"The Theory and Applications of Graphs","first-page":"557","article-title":"Subtrees of a graph and the chromatic number","author":"Sumner","year":"1981"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB183","first-page":"A","article-title":"Domination perfect graphs","volume":"26","author":"Sumner","year":"1979","journal-title":"Notices Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB184","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190100308","article-title":"Reflections on graph theory","volume":"10","author":"Thomassen","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB185","first-page":"374","article-title":"Forbidden subgraphs, degrees, neighborhood unions and circumferences of graphs","volume":"4","author":"Tian","year":"1991","journal-title":"Systems Sci. Math. Sci."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB186","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0012-365X(91)90473-F","article-title":"On graphs with equal domination and independent domination numbers","volume":"96","author":"Topp","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB187","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(83)90165-6","article-title":"Existence of dominating cycles and paths","volume":"43","author":"Veldman","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB188","first-page":"25","article-title":"On an estimate of the chromataic number of a p-graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Discret. Anal."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB189","first-page":"110","article-title":"Longest cycles in 3-connected and claw-free graphs","volume":"27","author":"Wang","year":"1991","journal-title":"J. Nanjing Univ. Nat. Sci."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB190","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0095-8956(73)90038-5","article-title":"The binding number of a graph and its Anderson number","volume":"15","author":"Woodall","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB191","first-page":"447","article-title":"Hamilton connectivity of K1,3-free graphs","volume":"9","author":"Wu","year":"1989","journal-title":"J. Math. Res. Exposition"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB192","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/jgt.3190120211","article-title":"Hamilton cycles in claw-free graphs","volume":"12","author":"Zhang","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB193","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(89)90186-6","article-title":"Cycles of given length in some K1,3-free graphs","volume":"78","author":"Zhang","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00045-3_BIB194","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1002\/jgt.3190130602","article-title":"A necessary and sufficient condition for connected, locally k-connected K1,3-free graphs to be k-hamiltonian","volume":"13","author":"Zhou","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB195","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/jgt.3190150202","article-title":"A characterizaton of domination perfect graphs","volume":"15","author":"Zverovich","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB196","series-title":"Hamilton cycles in 7-connected line graphs","author":"Jackson","year":"1989"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB197","series-title":"A note on hamiltonian claw-free graphs","author":"Li","year":"1996"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB198","series-title":"On a closure concept in claw-free graphs","author":"Ryj\u00e1\u010dek","year":"1996"},{"key":"10.1016\/S0012-365X(96)00045-3_BIB199","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(91)90401-M","article-title":"On hamiltonian line graphs and connectivity","volume":"89","author":"Zhan","year":"1991","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000453?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000453?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T02:41:31Z","timestamp":1620528091000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96000453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":200,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0012365X96000453"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00045-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}