A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Characterizing forbidden clawless triples implying hamiltonian graphs
2002
Discrete Mathematics
Preserved Fulltext
In this paper we characterize those forbidden triples of graphs, no one of which is a generalized claw, su cient to imply that a 2-connected graph of su ciently large order is hamiltonian. ...
In this paper we characterize those forbidden triples XYZ of connected graphs, none of which is a generalized claw K 1;r , (r ¿ 3), which imply that every 2-connected XYZ-free graph of su ciently large ...
Questions Brousek [3] determined all triples XYZ with X = K 1; 3 such that XYZ-free implies the graph is hamiltonian, but none of the pairs of the triple implies hamiltonian. ...
doi:10.1016/s0012-365x(01)00235-7
fatcat:uj35yqks2rdzjemwb3afkvytui
Author index
2002
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Lesniak, Characterizing forbidden clawless triples implying hamiltonian graphs (1-3) 71-81 Favaron, O., S.M. Hedetniemi, S.T. Hedetniemi and D.F. ...
Yu, A note on fragile graphs (1-3) 41-43 Chen, G., A. Saito, B. Wei and X. Zhang, The hamiltonicity of bipartite graphs involving neighborhood unions (1-3) 45-56 Corteel, S., see A. ...
doi:10.1016/s0012-365x(02)00277-7
fatcat:s5wqhobycrgn3kc2st32twlh4m
Page 6549 of Mathematical Reviews Vol. , Issue 2003i
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
|Lesniak, Linda M.] (1-DREW; Madison, NJ) Characterizing forbidden clawless triples implying Hamiltonian graphs. (English summary) Combinatorics, graph theory and computing (Louisville, KY, 1999). ...
Summary: “In this paper we characterize those forbidden triples of graphs, no one of which is a generalized claw, sufficient to imply that a 2-connected graph of sufficiently large order is Hamilton- ian ...
Page 7767 of Mathematical Reviews Vol. , Issue 2002K
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Lesniak], Characterizing forbidden clawless triples implying Hamiltonian graphs (71-81); O. Favaron, S. M. Hedetniemi, S. T. Hedetniemi and D. F. Rall, On &-dependent domination (83
94); Jerrold R. ...
(268-271); Alin Blaga, A parallel approach of the constrained normal form of a perturbed Keplerian Hamiltonian (272-275); Y. ...
Master index
2002
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Van der Jeugt, On the diameter
of the rotation graph of binary coupling trees
245
(2002)
1} 18
Lesniak, Characterizing forbidden clawless triples im-
plying hamiltonian graphs
249
(2002) 71} 81 ...
Faudree, Forbidden subgraphs that imply k-ordered and k-ordered hamiltonian 243 (2002) 91}108 Faudree, R.J., R.J. Gould, M.S. Jacobson and L.L. ...
doi:10.1016/s0012-365x(02)00424-7
fatcat:qb7jj3cfobhopcjrvcta4u3loy
Page 172 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Characterizing forbidden clawless triples implying Hamiltonian graphs. (English summary) 2003i:05081
— (with Gould, Ronald J.; Kostochka, A. ...
Some graphs containing unique Hamiltonian cycles. (English summary) 2003b:05104
Mao, Lin Fan New localized neighborhood union condition for Hamiltonian graphs. ...