Lower bound for the size of maximal nontraceable graphs.
Frick, Marietjie, Singleton, Joy (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Heavy Subgraphs, Stability and Hamiltonicity”
Lower bound for the size of maximal nontraceable graphs.
On pancyclic line graphs
Ladislav Nebeský (1978)
Czechoslovak Mathematical Journal
Similarity:
On squares of complementary graphs
Ladislav Nebeský (1980)
Mathematica Slovaca
Similarity:
Arbitrarily traceable Eulerian graph has the Hamiltonian square
Milan Sekanina, Anna Sekaninová (1982)
Archivum Mathematicum
Similarity:
A note on line graphs
Ladislav Nebeský (1974)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
A theorem on Hamiltonian line graphs
Ladislav Nebeský (1973)
Commentationes Mathematicae Universitatis Carolinae
Similarity: