Closure concepts: A survey

Graphs and Combinatorics

Volumn 16, Issue 1, 2000, Pages 17-48

  Broersma, Hajo ^a   Ryjáček, Zdeněk ^b   Schiermeyer, Ingo ^c  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

^c TU BERGAKADEMIE FREIBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037607046     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003730050002     Document Type: Review

References (79)

1. Ainouche, A., Christofides, N.: Strong sufficient conditions for the existence of hamiltonian cycles in undirected graphs. J. Comb. Theory B 31, 339-343 (1981)
2. Ainouche, A., Christofides, N.: Semi-independence number of a graph and the existence of hamiltonian circuits. Discrete Applied Math. 17, 213-221 (1987)
3. Amar, D., Favaron, O., Mago, P., Ordaz, O.: Biclosure and bistability in a balanced bipartite graph. J. Graph Theory 20, 513-529 (1995)
4. Bauer, D., Broersma, H.J., Rao, L., Veldman, H.J.: A generalization of a result of Häggkvist and Nicoghossian. J. Comb. Theory B 47, 237-243 (1989)
5. Bedrossian, P.: Forbidden subgraph and minimum degree conditions for hamiltonicity. Thesis, Memphis State Univ. USA, 1991
6. Bertossi, A.A.: The edge hamiltonian path problem is NP-complete. Inform. Process. Lett. 13, 157-159 (1981)
7. Bollobás, B., Riordan, O., Ryjáček, Z., Saito, A., Schelp, R.H.: Closure and hamiltonian-connectivity of claw-free graphs. Discrete Math. 195, 171-177 (1999)
8. Bondy, J.A.: Properties of graphs with constraints on degrees. Studia Sci. Math. Hungar. 4, 473-475 (1969)
9. Bondy, J.A., Chvátal, V.: A method in graph theory. Discrete Math. 15, 111-135 (1976)
10. Bondy, J.A., Murty, U.S.R.: Graph Theory Applications. Macmillan, London and Elsevier, New York, 1976
11. Brandt, S.: Computing the independence number of dense triangle-free graphs. Graph-Theoretic Concepts in Computer Science. Proc. WG 97, R.H. Möhring, ed. Lecture Notes in Computer Science 1335, Springer 100-108, (1997)
12. Brandt, S.: 9-connected claw-free graphs are Hamilton-connected. J. Comb. Theory Ser. B 75, 167-173 (1999)
13. Brandt, S.: On the structure of dense triangle-free graphs. Comb. Probab. Comp. 8, 237-246 (1999)
14. Brandt, S., Favaron, O., Ryjáček, Z.: Closure and stable hamiltonian properties in claw-free graphs. J. Graph Theory (to appear)
15. Brandt, S., Veldman, H.J.: Degree sums for edges and cycle lengths in graphs. J. Graph Theory 25, 253-256 (1997)
16. Broersma, H.J.: A note on hamiltonian graphs. Annal Discrete Math. 41, 71-74 (1989)
17. 4-closures in hamiltonian graph theory. Discrete Math. 121, 19-23 (1993)
18. Broersma, H.J., Schiermeyer, I.: A closure concept based on neighbourhood unions of independent triples. Discrete Math. 124, 37-47 (1994)
19. Broersma, H.J., Schiermeyer, I.: Subgraphs, closures and hamiltonicity. Discrete Applied Math. 51, 39-46 (1994)
20. Broersma, H.J., Trommel, H.: Closure concepts for claw-free graphs. Discrete Math. 185, 231-238 (1998)
21. Brousek, J.: Minimal 2-connected non-hamiltonian claw-free graphs. Discrete Math. 191, 54-64 (1998)
22. Brousek, J., Favaron, O., Ryjáček, Z.: Forbidden subgraphs, hamiltonicity and closure in claw-free graphs. Discrete Math. 196, 29-50 (1999)
23. Brousek, J., Ryjáček, Z., Schiermeyer, I.: Forbidden subgraphs, stability and hamiltonicity. Discrete Math. 197/198, 143-155 (1999)
24. Chvátal, V.: On hamilton's ideals. J. Combin. Theory B 12, 163-168 (1972)
25. Chvátal, V.: Hamiltonian cycles, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds., The Traveling Salesman Problem. Wiley, Chichester, 403-429 (1985)
26. Clark, L., Entringer, R.C., Jackson, D.E.: Minimum graphs with complete k-closure. Discrete Math. 30, 95-101 (1980)
27. Dankelmann, P., Niessen, T., Schiermeyer, I.: On path-tough graphs. Siam Journal on Discrete Math. 7, 571-584 (1994)
28. Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. 2, 69-81 (1952)
29. Dirac, G.A.: Note on hamilton circuits and hamilton paths. Math. Ann. 206, 139-147 (1973)
30. Fan, G.: Personal communication (1997)
31. Faudree, R.J., Favaron, O., Flandrin, E., Li, H.: The complete closure of a graph. J. Graph Theory 17, 481-494 (1993)
32. Faudree, R.J., Favaron, O., Flandrin, E., Li, H.: Pancyclism and small cycles in graphs. Discuss. Math. Graph Theory 16, 27-40 (1996)
33. Faudree, R.J., Flandrin, E., Ryjáčcek, Z.: Claw-free graphs - a survey. Discrete Math. 164, 87-147 (1997)
34. Faudree, R.J., Gould, R.J.: Characterizing forbidden pairs for hamiltonian properties. Discrete Math. 173, 45-60 (1997)
35. Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L.: Neighborhood closures of graphs. Colloq. Math. Soc. Janos Bolyai 52, 227-237 (1987)
36. Faudree, R.J., Gould, R.J., Jacobson, M.S., Schelp, R.H.: Neighborhood unions and hamiltonian properties of graphs. J. Comb. Theory B 47, 1-9 (1989)
37. Favaron, O., Flandrin, E., Li, Hao, Ryjáček, Z.: Clique covering and degree conditions for hamiltonicity in claw-free graphs. Preprint 1997 (submitted)
38. Favaron, O., Fraisse, P.: Hamiltonicity and minimum degree in 3-connected claw-free graphs. Rapport de Recherche No. 1219, L.R.I., Univ. Paris-Sud, Orsay, France, 1999
39. Gurgel, M.A., Wakabayashi, Y.: On k-leaf-connected graphs. J. Combin. Theory B 41, 1-16 (1986)
40. Häggkvist, R.: On the structure of non-hamiltonian graphs I. Combinatorics, Probabil Comp. 1, 27-34 (1992)
41. Hanson, D.: Hamilton closures in domination critical graphs. J. Comb. Math. and Comb. Comp. 13, 121-128 (1993)
42. Hasratian, A.S., Khachatrian, N.K.: Some localization theorems on hamiltonian circuits. J. Comb. Theory B 49, 287-294 (1990)
43. Hasratian, A.S., Khachatrian, N.K.: Stable properties of graphs. Discrete Math. 90, 143-152 (1991)
44. Hayes, D., Schmeichel, E.: Some extensions of Ore's theorem. In: Graph Theory and its Applications to Algorithms and Computer Science pp. 687-695 Wiley, New York, 1985
45. Hendry, R.T.: Extending cycles in graphs. Discrete Math. 85, 59-72 (1990)
46. Ishizuka, S.: Closure, path-factors and path coverings in claw-free graphs. Ars Comb. 50, 115-128 (1998)
47. Ishizuka, S.: Closure and (2, n)-factor-criticality of claw-free graphs. Preprint 1998, Keio Univ. Yokohama, Japan
48. Jackson, B.: Hamilton cycles in 7-connected line graphs. Preprint 1989 (unpublished)
49. Jung, H.A.: On maximal circuits in finite graphs. Annals of Discrete Math. 5, 129-144 (1978)
50. Khuller, S.: On computing graph closures. Information Process. Letters 31, 249-255 (1989)
51. Kovářik, O., Mulač, M., Ryjáček, Z.: A note on degree conditions for hamiltonicity in 2-connected claw-free graphs. Preprint No. 124/1999, Univ. of West Bohemia, Pilsen, 1999 (submitted)
52. Kuipers, E.J., Veldman, H.J.: Recognizing claw-free hamiltonian graphs with large minimum degree. Preprint 1998 (submitted)
53. Las Vergnas, M.: Thesis, University of Paris VI, France, 1972
54. Lesniak, L.: Some recent results in hamiltonian graphs. J. Graph Theory 1, 27-36 (1977)
55. Li, H.: A note on hamiltonian claw-free graphs. Rapport de Recherche 1022, Univ. Paris-Sud, Orsay, France, 1996
56. Möhring, R.H.: Triangulating graphs without asteroidal triples. Discrete Applied Math. 64, 281-287 (1996)
57. Monti, A.: On the computational complexity of graph closures. Inform. Process. Letters 57, 291-295 (1996)
58. Niessen, T.: Complete closure and regular factors. J. Comb. Math, and Comb. Comp. 25, 145-160 (1997)
59. Niessen, T.: Personal communication (1998)
60. Ore, O.: Note on hamiltonian circuits. Amer. Math. Month. 67, 55 (1960)
61. Plummer, M.D., Saito, A.: Closure and factor-critical graphs. Preprint 1997
62. Pósa, L.: A theorem concerning hamilton lines. Magyar Tud. Akad. Mat. Kukato Int. Közl. 8, 335-361 (1963)
63. Randerath, B., Schiermeyer, I., Tewes, M., Volkmann, L.: Vertex pancyclic graphs. Manuscript 1998
64. Ryjáček, Z.: On a closure concept in claw-free graphs. J. Comb. Theory B 70, 217-224 (1997)
65. Ryjáček, Z., Saito, A., Schelp, R.H.: Closure, 2-factors and cycle coverings in claw-free graphs. J. Graph Theory 32, 109-117 (1999)
66. Ryjáček, Z., Saito, A., Schelp, R.H.: Claw-free graphs with complete closure. Preprint 1997 (submitted)
67. Saito, A., Schiermeyer, I.: Private communication, 1999
68. Schelten, U.: Knotengrade und Nachbarschaftsvoraussetzungen als hinreichende Bedingungen für Kreise in Graphen. Dissertation, RWTH Aachen, Germany, 1997
69. Schelten, U., Schiermeyer, I.: Small cycles in hamiltonian graphs. Discrete Appl. Math. 79, 201-211 (1997)
70. Schiermeyer, I.: Algorithmen zum Auffinden längster Kreise in Graphen. Dissertation, RWTH Aachen, Germany, 1988
71. Schiermeyer, I.: A fast sequential and parallel algorithm for the computation of the k-closure of a graph. WG'89, Lect. Notes Comp. Sci. 411, 211-217 (1989)
72. Schiermeyer, I.: Triple closure operations and graphical properties. RWTH Aachen, Preprint 1990
73. Schiermeyer, I.: Computation of the 0-dual closure for several classes of hamiltonian graphs. Discrete Math. 111, 455-464 (1993)
74. Skupień, Z.: n-Closures of large nonhamiltonian n-vertex graphs. In: Graphs, Hypergraphs and Matroids. Zielona Góra, 59-66 (1985)
75. Stacho, L.: Degrees, neighborhoods and closure operations. Preprint 1999
76. Szwarcfiter, J.L.: A note on the computation of the k-closure of a graph. Inform. Process. Letters 24, 279-280 (1987)
77. Zhan, S.: On hamiltonian line graphs and connectivity. Discrete Math. 89, 89-95 (1991)
78. Zhu, Y., Tian, F.: A generalization of the Bondy-Chvátal Theorem on the k-closure. J. Comb. Theory B 35, 247-255 (1983)
79. Zhu, Y., Tian, F., Deng, X.: More powerful closure-operations on graphs. Discrete Math. 87, 197-214 (1991)