Lower bound for the size of maximal nontraceable graphs.
Frick, Marietjie, Singleton, Joy (2005)
The Electronic Journal of Combinatorics [electronic only]
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.
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 “Measures of traceability in graphs.”
Lower bound for the size of maximal nontraceable graphs.
Arbitrarily traceable Eulerian graph has the Hamiltonian square
Milan Sekanina, Anna Sekaninová (1982)
Archivum Mathematicum
Similarity:
On a -factor of the fourth power of a connected graph
Ladislav Nebeský (1988)
Časopis pro pěstování matematiky
Similarity:
Hamiltonicity of -traceable graphs.
Bullock, Frank, Dankelmann, Peter, Frick, Marietjie, Henning, Michael A., Oellermann, Ortrud R., van Aardt, Susan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Heavy Subgraphs, Stability and Hamiltonicity
Binlong Li, Bo Ning (2017)
Discussiones Mathematicae Graph Theory
Similarity:
Let G be a graph. Adopting the terminology of Broersma et al. and Čada, respectively, we say that G is 2-heavy if every induced claw (K1,3) of G contains two end-vertices each one has degree at least |V (G)|/2; and G is o-heavy if every induced claw of G contains two end-vertices with degree sum at least |V (G)| in G. In this paper, we introduce a new concept, and say that G is S-c-heavy if for a given graph S and every induced subgraph G′ of G isomorphic to S and every maximal clique...
On eulerian subgraphs of complementary graphs
Ladislav Nebeský (1979)
Czechoslovak Mathematical Journal
Similarity: