On Hamiltonian cycles in two-triangle graphs
Jan Kratochvíl, Dainis A. Zeps (1987)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A Note on Barnette’s Conjecture”
On Hamiltonian cycles in two-triangle graphs
On pancyclic line graphs
Ladislav Nebeský (1978)
Czechoslovak Mathematical Journal
Similarity:
Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs.
McKee, Terry A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A traceability conjecture for oriented graphs.
Frick, Marietjie, van Aardt, Susan A., Dunbar, Jean E., Nielsen, Morten H., Oellermann, Ortrud R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lower bound for the size of maximal nontraceable graphs.
Frick, Marietjie, Singleton, Joy (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Erdős-Gyárfás Conjecture in Claw-Free Graphs
Pouria Salehi Nowbandegani, Hossein Esfandiari, Mohammad Hassan Shirdareh Haghighi, Khodakhast Bibak (2014)
Discussiones Mathematicae Graph Theory
Similarity:
The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the Erdős-Gyárfás conjecture holds in claw-free graphs. In this paper, we obtain some results on this question, in particular for cubic claw-free graphs
On cubic planar hypohamiltonian and hypotraceable graphs.
Araya, Makoto, Wiener, Gábor (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: