×

zbMATH — the first resource for mathematics

On H-closed graphs. (English) Zbl 0699.05059
A graph G is H-closed if each subgraph F of G isomorphic to a subgraph of H may be extended to a subgraph of G isomorphic to H. Among other results the H-closed graphs for H being k-regular, \(k\geq 2\), are characterized.
Reviewer: Ch.Schulz

MSC:
05C99 Graph theory
05C45 Eulerian and Hamiltonian graphs
PDF BibTeX XML Cite
Full Text: EuDML
References:
[1] G. Chartrand H. V. Kronk: Randomly traceable graphs. SIAM J. Appl. Math. 16 (1968) 696-700. · Zbl 0164.54202
[2] G. Chartrand H. V. Kronk D. R. Lick: Randomly hamiltonian digraphs. Fund. Math. 65 (1969) 223-226. · Zbl 0181.27304
[3] G. Chartrand D. R. Lick: Randomly eulerian digraphs. Czech. Math. J. 21 (1971) 424-430. · Zbl 0221.05066
[4] G. Chartrand O. R. Oellermann S. Ruiz: Randomly \(H\)-Graphs. To appear in Math. Slovaca. · Zbl 0655.05052
[5] G. A. Dirac C. Thomassen: Graphs in which every finite path is contained in a circuit. Math. Ann. 203 (1973) 65-75. · Zbl 0239.05129
[6] D. B. Erickson: Arbitrarily traceable graphs and digraphs. J. Combinatorial Theory Ser. B 19 (1975) 5-23. · Zbl 0278.05109
[7] F. Harary: On arbitrarily traceable graphs and directed graphs. Scripta Math. 23 (1957) 37-51. · Zbl 0084.19403
[8] O. Ore: A problem regarding the tracing of graphs. Elem. Math. 6 (1951) 49-53. · Zbl 0043.38503
[9] T. D. Parsons: Paths extendable to cycle. J. Graph Theory 2 (1978) 337-339. · Zbl 0419.05033
[10] J. Sheehan: Fixing Subgraphs and Ulam’s Conjecture. J. Combinatorial Theory 14 (1973) 125-131. · Zbl 0271.05125
[11] J. Sheehan: Fixing sub-graphs. J. Combinatorial Theory 12 (1972) 226-244. · Zbl 0233.05112
[12] D. P. Sumner: Randomly matchable graphs. J. Graph Theory 3 (1979) 183-186. · Zbl 0404.05053
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.