Claw-free graphs - A survey

Discrete Mathematics

Volumn 164, Issue 1-3, 1997, Pages 87-147

  Faudree, Ralph ^a   Flandrin, Evelyne ^b   Ryjáček, Zdeněk ^c  

^a University of Memphis   (United States)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006673321     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00045-3     Document Type: Article

References (201)

1. A. Ainouche, Hamiltonian and traceable claw-free graphs, preprint.
2. A. Ainouche, H.J. Broersma and H.J. Veldman, Remarks on hamiltonian properties of claw-free graphs, Ars. Combin. 29C (1990) 110-121.
3. J. Akiyama and M. Kano, Factors and factorizations of graphs - a survey, J. Graph Theory 9 (1985) 1-42.
4. R.B. Allan and R. Laskar, On domination and independent domination numbers of a graph, Discrete Math. 23 (1978) 73-76.
5. N. Alon and R.B. Boppana, The monotone circuit complexity of boolean functions. Combinatorica 7 (1987) 1-22.
6. O.A. Ambartsumian, A.S. Asratian and G.V. Sarkisian, Some local conditions of hamiltonicity and pancyclicity of a graph, Dokl. Akad. Nauk Armenia 91 (1990) 19-22 (in Russian).
7. A.S. Asratian, H.J. Broersma, J. Van den Heuvel and H.J. Veldman, On graphs satisfying a local Ore-type condition, preprint.
8. A.S. Asratian and N.K. Khachatrian, Some localization theorems on hamiltonian circuits. J. Combin. Theory Ser. B 49 (1990) 287-294
9. R. Balakrishnan and P. Paulraja, Chordal graphs and some of their derived graphs, Congr. Numer. 53 (1986) 71-74.
10. D. Barraez, E. Flandrin, Hao Li and O. Ordaz, Dominating cycles in bipartite biclaw-free graphs, Rapport de Recherche L.R.I. No. 682, Univ. de Paris-Sud, Orsay, 1991.
11. D. Bauer, G. Fan and H.J. Veldman, Hamilton properties of graphs with large neighborhood unions, Discrete Math. 96 (1991) 33-49.
12. P. Bedrossian, Forbidden subgraph and minimum degree conditions for hamiltonicity, Thesis, Memphis State University, USA, 1991.
13. P. Bedrossian, G. Chen and R.H. Schelp, A generalization of Fan's condition for hamiltonicity, pancyclicity and hamiltonian connectedness, Discrete Math. 115 (1993) 39-50.
14. L.W. Beineke, Derived graphs and digraphs, Beiträge zur Graphentheorie (Teubner, Leipzig, 1968).
15. L.W. Beineke, Characterizations of derived graphs, J. Combin. Theory Ser. B 9 (1970) 129-135.
16. A. Ben Rebea, Etude des stables dans les graphes quasi adjoints, Thèse, Université de Grenoble, 1981.
17. A.A. Bertossi, The edge hamiltonian path problem is NP-complete, Inform. Process. Lett. 13 (1981) 157-159.
18. B. Bollobás and E.J. Cockayne, Graph-theoretic parameters concerning domination, independence and irredundance. J. Graph Theory 3 (1979) 241-249.
19. J.A. Bondy, Basic graph theory: paths and circuits, preprint, 1992.
20. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, London, and Elsevier, New York, 1976).
21. 1,3-free graphs, preprint, 1986 (unpublished).
22. H.J. Broersma, Subgraph conditions for dominating circuits in graphs and pancyclicity of line graphs, Ars Combin. 23 (1987) 5-12.
23. H.J. Broersma, Hamilton cycles and related topics, Doctoral Thesis, Univ. of Twente, Enschede, 1988.
24. H.J. Broersma, J. Van den Heuvel, H.A. Jung and H.J. Veldman, Long paths and cycles in tough graphs, Graphs Combin. 9 (1993) 3-17.
25. H.J. Broersma and M. Lu, Cycles through particular subgraphs of claw-free graphs, Memorandum 1097, Univ. of Twente, Enschede, 1992.
26. H.J. Broersma, Z. Ryjáček and I. Schiermeyer, Toughness and hamiltonicity in almost claw-free graphs, Memorandum 1114, Univ. of Twente, Enschede, 1993.
27. H.J. Broersma, Z. Ryjáček and I. Schiermeyer, Unifying results on hamiltonian claw-free graphs, preprint, University of West Bohemia, Pilsen, 1994.
28. H.J. Broersma and H.J. Veldman, 3-connected line graphs of triangular graphs are panconnected and 1-hamiltonian, J. Graph Theory 11 (1987) 399-407.
29. 1,3-free graphs in: R. Bodendiek, ed., Contemporary methods in Graph Theory (BI-Wiss.-Verl., Mannheim-Wien-Zürich, 1990) 181-194.
30. 4-closures in hamiltonian graph theory, Discrete Math. 121 (1993) 19-23.
31. G. Chartrand, R.J. Gould and A.D. Polimeni, A note on locally connected and hamiltonian-connected graphs, Israel J. Math. 33 (1979) 5-8.
32. G. Chartrand, A.D. Polimeni and M.J. Stewart, The existence of 1-factors in line graphs, squares, and total graphs, Indag. Math. 35 (1973) 228-232.
33. 1-r-free graphs, preprint.
34. 1-3-free graphs, Combinatorics, graph theory, algorithms and applications (Beijing 1993) World Sci. Publishing, River Edge, N.J. (1994) 151-160.
35. Ziqi Chen and Yaofang Xue, Hamilton cycle and dominating cycle in k-connected claw-free graphs, Nei Mongol Daxue Xuebao Ziran Kexue 22 (1991) 473-476.
36. Ziqi Chen and Yaofang Xue, Extendable cycles in N-locally connected claw-free graphs (Chinese, English summary), J. Nanjing Univ. Natur. Sci., Spec. Issue on Graph Theory, 27 (1991) 38-42.
37. S.A. Choudum, Chromatic bounds for a class of graphs, Quart J. Math. Oxford Ser. 2 28 (1977) 257-270.
38. 1-3-free graphs, J. Graph Theory 15 (1991) 259-265.
39. F.R.K. Chung and R.L. Graham, On graphs not containing prescribed induced subgraphs, in: A tribute to Paul Erdos 97-104 (Cambridge Univ. Press, Cambridge, 1990).
40. V. Chvátal, Tough graphs and hamiltonian circuits, Discrete Math. 5 (1973) 215-228.
41. V. Chvátal, Which claw-free graphs are perfectly orderable?, Discrete Appl. Math. 44 (1993) 39-63.
42. V. Chvátal and P. Erdos, A note on hamiltonian circuits, Discrete Math. 2 (1972) 111-135.
43. V. Chvátal and N. Sbihi, Recognizing claw-free perfect graphs, J. Combin. Theory Ser. B 44 (1988) 154-176.
44. L. Clark, Hamiltonian properties of connected locally connected graphs, Congr. Numer. 32 (1981) 199-204.
45. 1,3-free graphs (Chinese, English summary), J. Northeast. Univ. Tech. 12 (1991) 303-3-7.
46. 1-3-free graph and D.R. Woodall's conjecture (Chinese), J. Nanjing Univ. Nat. Sci., Spec. Issue on Graph Theory 27 (1991) 93-97.
47. C. De Simone and A. Sassano, Stability number of bull-and chair-free graphs, Discrete Appl. Math. 41 (1993) 121-129.
48. D.A. Diny, F. Harary and F.R. McMorris, A survey of results on a graph with specified hereditary properties, Ars Combin. 20B (1985) 193-205.
49. M. Dhurandhar, On the chromatic number of a graph with two forbidden subgraphs, J. Combin. Theory Ser. B 46 (1989) 1-6.
50. D. Duffus, M.S. Jacobson and R.J. Gould, Forbidden subgraphs and the hamiltonian theme, in: The Theory and Applications of Graphs (Kalamazoo, Mich. 1980, Wiley, New York, 1981) 297-316.
51. J. Edmonds, Paths, trees, and flowers, Canad. J. Math. 17 (1965) 449-467.
52. 1-n-free graphs, J. Graph Theory 15 (1991) 337-344.
53. M.N. Ellingham, L. Pyber and X. Yu, Claw-free graphs are edge-reconstructible. J. Graph Theory 12 (1988) 445-451.
54. R.J. Faudree, R.J. Gould and T.E. Lindquester, Hamiltonian properties and adjacency conditions in K(1,3)-free graphs, Proc. 6th Interna. Conf. on Theory and Applications of Graphs, Kalamazoo, 1988; Graph Theory, Combin. Appl. 1 (1991) 467-479.
55. R.J. Faudree, R.J. Gould and T.E. Lindquester, Hamiltonian properties and adjacency conditions in K(1,3)-free graphs, Proc. 6th Interna. Conf. on Theory and Applications of Graphs, Kalamazoo, 1988; Graph Theory, Combin. Appl. 1 (1991) 467-479.
56. R.J. Faudree, R.J. Gould, L.M. Lesniak and T.E. Lindquester, Generalized degree conditions for graphs with bounded independence number, J. Graph Theory 19 (1995) 397-409.
57. R.J. Faudree, R.J. Gould, M.S. Jacobson and L.M. Lesniak, Degree conditions and cycle extendability, Discrete Math. 141 (1995) 109-122.
58. R.J. Faudree, R.J. Gould, M.S. Jacobson, L.M. Lesniak and T.E. Lindquester, On independent generalized degrees and independence numbers in K(1,m)-free graphs, Discrete Math. 103 (1992) 17-24.
59. R.J. Faudree, R.J. Gould, M.S. Jacobson, L.M. Lesniak and T.E. Lindquester, A generalization of Dirac's theorem for K(1,3)-free graphs, Periodica Math. Hungar. 24 (1992) 35-50.
60. R. Faudree, Z. Ryjáček and I. Schiermeyer, Forbidden subgraphs and cycle extendability, J. Comb. Math. Comb. Comp. 19 (1995) 109-128.
61. R. Faudree, Z. Ryjáček and I. Schiermeyer, Local connectivity and cycle extension in claw-free graphs, Ars Combin. to appear.
62. O. Favaron, Stability, domination and irredundance in a graph, J. Graph Theory 10 (1986) 429-438.
63. O. Favaron, E. Flandrin, Hao Li and Z. Ryjáček, Shortest walks in almost claw-free graphs, Rapport de Recherche L.R.I. No 809, Univ. Paris-Sud, Orsay, 1993.
64. J.F. Fink and M.S. Jacobson, On n-domination, n-dependence and forbidden subgraphs, in: Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, Mich., 1984) (Wiley-Intersci. Publ., Wiley, New York, 1985) 301-311.
65. E. Flandrin, Cycles hamiltoniens et dominants dans le carré d'un graphe connexe, Rapport L.R.I. No. 208, Univ. Paris-Sud, Orsay, 1985.
66. 1,3 et problèmes annexes, Thèse de Doctorat d'Etat, Université Paris-Sud, 1990.
67. E. Flandrin, J.L. Fouquet and Hao Li, On hamiltonian claw-free graphs, Discrete Math. 111 (1993) 221-229.
68. E. Flandrin, J.L. Fouquet and Hao Li, Hamiltonism in bipartite biclaw-free graphs, Rapport de Recherche L.R.I. No 693, Univ. Paris-Sud, Orsay, 1991.
69. 1,3-free graphs, Rapport de Recherche L.R.I. No. 282, Univ. Paris-Sud, Orsay, 1986.
70. 1,3-free graphs, in: Graph Theory in Memory of G.A. Dirac (Sandbjerg, 1985), Ann. Discrete Math., vol. 41 (North-Holland, Amsterdam, New York, 1989) 131-140.
71. E. Flandrin, H.A. Jung and Hao Li, Hamiltonism, degree sum and neighborhood intersections, Discrete Math. 90 (1991) 41-52.
72. E. Flandrin and Hao Li, Further result on neighbourhood intersections, Rapport de Recherche L.R.I. No. 416, Univ. Paris-Sud, Orsay, 1988.
73. E. Flandrin and Hao Li, Chvátal-Erdos condition in 3-connected claw-free graphs, Rapport de Recherche L.R.I. No. 500, Univ. Paris-Sud, Orsay, 1989.
74. E. Flandrin and Hao Li, Mengerian properties, hamiltonism and claw-free graphs, Networks 24 (1994) 177-183.
75. E. Flandrin and Hao Li, Hamiltonism and claws, Ars Combin. 29C (1990) 77-89.
76. E. Flandrin, Hao Li and I. Schiermeyer, Hamiltonism and vertices with a common neighbor, Rapport de Recherche L.R.I. No 690, Univ. Paris-Sud, Orsay, 1991.
77. J.L. Fouquet, A strengthening of Ben Rebea's lemma, J. Combin. Theory Ser. B 59 (1993) 35-40.
78. P. Fraisse, A new sufficient condition for hamiltonian graphs, J. Graph Theory 10 (1986) 405-409.
79. J. Fulman, A note on the characterization of domination perfect graphs, J. Graph Theory 17 (1993) 47-51.
80. H. Galeana-Sánchez, On claw-free M-oriented kernel-imperfect graphs, preprint, 1992.
81. D. Gernert, Forbidden and unavoidable subgraphs, Ars Combin. 27 (1989) 165-176.
82. P.C. Gilmore and A.J. Huffman, A characterization of comparability graphs, Canad. J. Math. 16 (1964) 539-548.
83. 1,3-free graphs, J. Combin. Theory Ser. B 31 (1981) 313-326.
84. R. Giles, L.E. Trotter and A. Tucker, The strong perfect graph theorem for a class of partitionable graphs, Ann. Discrete Math. 21 (1984) 161-167.
85. W. Goddard, The binding number of trees and K(1,3)-free graphs, J. Combin. Math. Combin. Comput. 7 (1990) 193-200.
86. S. Goodman and S. Hedetniemi, Sufficient conditions for a graph to be hamiltonian, J. Combin. Theory Ser. B 16 (1974) 175-180.
87. R.J. Gould, Traceability in graphs, Doctoral Thesis, Western Michigan University, 1979.
88. R.J. Gould, Updating the Hamiltonian problem - a survey, J. Graph Theory 15 (1991) 121-157.
89. R.J. Gould and M.S. Jacobson, Forbidden subgraphs and hamiltonian properties of graphs, Discrete Math. 42 (1982) 189-196.
90. R.J. Gould and M.S. Jacobson, Forbidden subgraphs and Hamiltonian properties in the square of a connected graph, J. Graph Theory 8 (1984) 147-154.
91. Y.O. Hamidoune, On the numbers of independent k-sets in a claw-free graph, J. Combin. Theory Ser. B 50 (1990) 241-244.
92. P.L. Hammer, N.V.R. Mahadev and D. de Werra, Stability in CAN-free graphs, J. Combin. Theory Ser. B 38 (1985) 23-30.
93. P.L. Hammer, N.V.R. Mahadev and D. de Werra, The structure of a graph: application to CN-free graphs. Combinatorica 5 (1985) 141-147.
94. F. Harary and A. Schwenk, Trees with hamiltonian square, Mathematika 18 (1971) 138-140.
95. S.T. Hedetniemi and R. Laskar, Recent results and open problems in domination theory. Applications of discrete mathematics (Clemson, SC, 1986) 205-218 (SIAM, Philadelphia, 1988).
96. 1,3)-free graph is vertex pancyclic, J. Graph Theory 9 (1985) 535-537.
97. G.R.T. Hendry, Extending cycles in graphs, Discrete Math. 85 (1990) 59-72.
98. A. Hertz and D. de Werra, On the stability number of AH-fees graphs, J. Graph Theory 17 (1993) 53-63.
99. W.-L. Hsu, How to color claw-free perfect graphs, Ann. Discrete Math. 11 (1981) 189-197.
100. W.-L. Hsu and G.L. Nemhauser, Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs, Discrete Math. 37 (1981) 181-191.
101. W.-L. Hsu and G.L. Nemhauser, A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs, Discrete Math. 28 (1982) 65-71.
102. W.-L. Hsu and G.L. Nemhauser, Algorithms for maximum weight cliques, minimum weighted clique covers and minimum colorings of claw-free perfect graphs, Ann. Discrete Math. 21 (1984) 357-369.
103. Z. Hu, A proof of Broersma and Veldman's conjectures, preprint, Huazhong Normal University.
104. B. Jackson, Hamilton cycles in regular 2-connected graphs, J. Combin. Theory Ser. B 29 (1980) 27-46.
105. B. Jackson, Concerning the circumference of certain families of graphs, Memorandum 1076, Univ. of Twente, Enschede (1992) 87-94.
106. B. Jackson and P. Katerinis, A characterization of 3/2-tough graphs, Ars Combin. 38 (1994) 145-148.
107. B. Jackson and N.C. Wormald, K-walks of graphs, Australas. J. Combin. 2 (1990) 135-146.
108. M. Javdekar, A note on Choundum's chromatic bounds for a class of graphs, J. Graph Theory 4 (1980) 265-268.
109. D.S. Johnson, The NP-completeness column: an ongoing guide, J. Algorithms 6 (1985) 434-451.
110. H.A. Jung, Note on hamiltonian graphs, M. Fiedler, ed., Recent Advances in Graph Theory (Academia, Prague, 1975) 315-321.
111. M. Jünger, G. Reinelt and W.R. Pulleyblank, On partitioning the edges of graphs into connected graphs, J. Graph Theory 9 (1985) 539-549.
112. 1,3-free graphs are panconnected, J. Graph Theory 8 (1984) 347-353.
113. J.J. Karaganis, On the cube of a graph, Canad. Math. Bull. 11 (1969) 295-296.
114. H.A. Kierstead, On the chromatic index of multigraphs without large triangles, J. Combin. Theory Ser. B 6 (1984) 156-160.
115. H.A. Kierstead, Applications of edge coloring of multigraphs to vertex colorings of graphs, Discrete Math. 74 (1989) 117-124.
116. H.A. Kierstead and J.H. Schmerl, Some applications of Vizing's theorem to vertex colorings of graphs, Discrete Math. 45 (1983) 277-285.
117. 5 - e, Discrete Math. 58 (1986) 253-262.
118. M. Knor, L'. Niepel and L'. Śortés, Centers in line graphs, Math. Slovaca 43 (1993) 11-20.
119. 1,3-free graphs, J. Combin. Theory Ser. B 49 (1990) 295-298.
120. M. Las Vergnas, A note on matchings in graphs, Cahiers Centre Etudes Rech. Opér. 17 (1975) 257-260.
121. Guojun Li, Zhenhong Liu and Mei Lu, Hamiltonian cycle in 3-connected claw-free graph, preprint.
122. Hao Li, Hamiltonian cycles in 2-connected claw-free graphs, preprint.
123. Hao Li, Problem A15, Memorandum 1076, Univ. of Twente, Enschede (1992) 119.
124. Hao Li, Mei Lu and Z. Sun, Hamiltonicity in 2-connected graphs with claws, preprint, 1993.
125. Hao Li and F. Tian, Degree sums, claws, and hamiltonicity, preprint, 1994.
126. Hao Li and C. Virlouvet, Neighborhood conditions for claw-free hamiltonian graphs, Ars Combin. 29A (1990) 109-116.
127. Mingchu Li, A note on circumferences of 3-connected claw-free graph, J. Nanjing Univ. Nat. Sci. (Spec. Issue on Graph Theory) 27 (1991) 98-105.
128. Mingchu Li, Pancyclism in claw-free graphs (Chinese, English summary), J. Nanjing Univ. Nat. Sci. (Spec. Issue on Graph Theory), 27 (1991) 123-126.
129. Mingchu Li, Hamiltonian cycles in 3-connected claw-free graphs, J. Graph Theory 17 (1993) 303-313.
130. Mingchu Li, Longest cycles in regular 2-connected claw-free graphs, Discrete Math. 137 (1995) 277-295.
131. 2-locally connected claw-free graphs, preprint.
132. Mingchu Li, On pancyclic claw-free graphs, preprint.
133. 1,3-free graphs, J. Graph Theory 17 (1993) 303-313.
134. Mingchu Li and Zhenhong Liu, Hamilton problems in claw-free graphs - a survey (Chinese, English summary). J. Nanjing Univ. Nat. Sci. (Spec. Issue on Graph Theory), 27 (1991) 223-231.
135. Yiping Liu, The maximum number of diagonals of cycles in claw-free graphs (Chinese, English summary), Shanghai Shifan Daxue Xuebao Ziran Kexue Ban 18 (1989) 10-17.
136. 1,3-free graphs, J. Changsha Railway Inst. 4 (1986) 105-106.
137. 1,3-free graphs, preprint, Nanjing University, China, 1987.
138. Zhenhong Liu, Zhengguang Yu and Yongjin Zhu, 2-connected, k-regular graphs on at most 3k + 3 vertices to be hamiltonian, J. Systems Sci. Math. Sci. 6 (1986) 36-49.
139. Z. Lonc and Z. Ryjáček, Factors of claw-free graphs, Czechoslovak Math. J. 41 (1991) 120-130.
140. L. Lovász, in: L.W. Beineke and R.J. Wilson, eds, Perfect Graphs, Selected Topics in Graph Theory (2), (Academic Press, NewYork, 1983) 56-87.
141. L. Lovász and M.D. Plummer, Matching Theory (Akadémiai Kiadó, Budapest, 1986); Ann. Discrete Math. 29 (1986).
142. L. Lovász and M.D. Plummer, Matching Theory (Akadémiai Kiadó, Budapest, 1986); Ann. Discrete Math. 29 (1986).
143. L.R. Markus, Disjoint Cycles in claw-free graphs, preprint.
144. 1,r-free graphs, Congr. Numer. 98 (1993) 143-149.
145. L.R. Markus and H.S. Snevily, Disjoint cycles in star-free graphs, preprint.
146. 1,3-free graphs, Congr. Numer. 49 (1985) 49-55.
147. 1,3-free graphs, Congr. Numer. 69 (1989) 77-89.
148. 1,3-free graphs, J. Graph Theory 8 (1984) 139-146.
149. 1,3-free graphs, J. Graph Theory 9 (1985) 269-277.
150. J.F. Maurras, Polytopes à sommets dans {0,1}, Thèse de Doctorat d'Etat, Université Paris 7.
151. G.J. Minty, On maximal independent sets of vertices in claw-free graphs, J. Combin. Theory Ser. B 28 (1980) 284-304.
152. L. Nebeský, Some sufficient conditions for the existence of a 1-factor, J. Graph Theory 2 (1978) 251-255.
153. L. Nebeský, On the existence of 1-factors in partial squares of graphs, Czechoslovak Math. J. 29 (1979) 349-352.
154. T. Nishimura, Regular factors of line graphs II, preprint.
155. D.J. Oberly and D.P. Sumner, Every connected, locally connected nontrivial graph with no induced claw is hamiltonian, J. Graph Theory 3 (1979) 351-356.
156. S. Olariu, Paw-free graphs, Inform. Process. Lett. 28 (1988) 53-54.
157. S. Olariu, The strong perfect graph conjecture for pan-free graphs, J. Combin. Theory Ser. B 47 (1989) 187-191.
158. 1,3-free graphs, J. Combin. Theory Ser. B 21 (1976) 212-223.
159. P. Paulraja, On graphs admitting spanning eulerian subgraphs, Ars Combin. 24 (1987) 57-65.
160. S. Poljak, A note on stable sets and coloring of graphs, Comment. Math. Univ. Carolin. 15 (1974) 307-309.
161. M.D. Plummer, Claw-free maximal planar graphs, Congr. Numer. 72 (1990) 9-23.
162. M.D. Plummer, Extending matchings in claw-free graphs, Proc. 13th British Combinatorial Conf., Guildford, 1991.
163. M.D. Plummer, 2-extendability and hamiltonicity in two classes of claw-free graphs, preprint, 1992.
164. Xiong Ping Qian and Rong Hua Shi, 3-connected, locally connected claw-free graphs are panconnected (Chinese, English summary), Gaoxiao Yingyong Shuxue Xuebao 6 (1991) 574-580.
165. 1,3-free graphs, in: Combinatorics and Graph Theory, Vol. 25 (Polish Scientific Publishers, Warsaw, Banach Centre Publications, 1989) 137-145.
166. 1,3-free graphs, J. Graph Theory 14 (1990) 321-331.
167. Z. Ryjáček, Almost claw-free graphs, J. Graph Theory 18 (1994) 469-477.
168. Z. Ryjáček, Hamiltonicity in claw-free graphs through induced bulls, Discrete Math. 140 (1995) 141-147.
169. 1,r-1-free graphs, preprint, Univ. of West Bohemia, 1993.
170. 1,r-free graphs with independent claw centers, preprint, Univ. of West Bohemia, Pilsen, 1994.
171. N. Sbihi, Algorithmes de recherche d'un stable de cardinalite maximum dans un graphe sans etoile, Discrete Math. 29 (1980) 53-76.
172. I. Schiermeyer, Neighborhood intersections and Hamiltonicity, in: Graph Theory, Combinatorics, Algorithms and Applications (San Francisco, CA,1989) 427-440 (SIAM, Philadelphia, 1991).
173. J. Sedláček, Local properties of graphs (Czech), Čas. Pěst. Mat. 106 (1981) 290-298.
174. M. Sekanina, On an ordering of the set of vertices of a connected graph, Spisy Prirod. Fak. Univ. Brno (1960) 137-141.
175. F.B. Shepherd, Claws, Thesis, University of Waterloo, 1987.
176. F.B. Shepherd, Hamiltonicity in claw-free graphs, J. Combin. Theory Ser. B 53 (1991) 173-194.
177. Ruqun Shen, Feng Tian and Bing Wei, Hamiltonicity of k-connected graphs with claws, preprint, 1994.
178. Rong Hua Shi, Connected and locally connected graphs with no induced claws are vertex pancyclic, Kexue Tongbao 31 (1986) 427.
179. Rong Hua Shi, 2-neighborhoods and hamiltonian conditions, J. Graph Theory 16 (1992) 267-271.
180. Ľ. Šuités, Forbidden induced subgraphs for line graphs, preprint.
181. Ľ. Šoltés, Neighborhoods in line graphs, Math. Slovaca 42 (1992) 427-436.
182. D.P. Sumner, Graphs with 1-factors, Proc. Amer. Math. Soc. 42 (1974) 8-12.
183. D.P. Sumner, 1-factors and antifactor sets, J. London Math. Soc. (2) 13 (1976) 351-359.
184. D.P. Sumner, Subtrees of a graph and the chromatic number, in: The Theory and Applications of Graphs (Kalamazoo, Mich., 1980) 557-576 (Wiley, New York, 1981).
185. D.P. Sumner and J.I. Moore, Domination perfect graphs, Notices Amer. Math. Soc. 26 (1979) A-569.
186. C. Thomassen, Reflections on graph theory, J. Graph Theory 10 (1986) 309-324.
187. F. Tian, Forbidden subgraphs, degrees, neighborhood unions and circumferences of graphs, Systems Sci. Math. Sci. 4 (1991) 374-381.
188. J. Topp and L. Volkmann, On graphs with equal domination and independent domination numbers, Discrete Math. 96 (1991) 75-80.
189. H.J. Veldman, Existence of dominating cycles and paths, Discrete Math. 43 (1983) 281-296.
190. V.G. Vizing, On an estimate of the chromataic number of a p-graph, Discret. Anal. 3 (1964) 25-30.
191. Jianglu Wang, Longest cycles in 3-connected and claw-free graphs (Chinese, English summary), J. Nanjing Univ. Nat. Sci. (Special Issue on Graph Theory) 27 (1991) 110-122.
192. D.R. Woodall, The binding number of a graph and its Anderson number, J. Combin. Theory Ser. B 15 (1973) 225-255.
193. 1,3-free graphs (Chinese, English summary), J. Math. Res. Exposition 9 (1989) 447-451.
194. C.-Q. Zhang, Hamilton cycles in claw-free graphs, J. Graph Theory 12 (1988) 209-216.
195. 1,3-free graphs, Discrete Math. 78 (1989) 307-313.
196. 1,3-free graphs to be k-hamiltonian, J. Graph Theory 13 (1989) 651-656.
197. I.E. Zverovich and V.E. Zverovich, A characterizaton of domination perfect graphs, J. Graph Theory 15 (1991) 109-114.
198. B. Jackson, Hamilton cycles in 7-connected line graphs, preprint (1989, unpublished).
199. Hao Li, A note on hamiltonian claw-free graphs, preprint, 1996.
200. Z. Ryjáček, On a closure concept in claw-free graphs, preprint, Univ. of West Bohemia, Pilsen, 1996.
201. S. Zhan, On hamiltonian line graphs and connectivity. Discrete Math. 89 (1991) 89-95.