On longest circuits in certain non-regular planar graphs
Michal Tkáč (1995)
Mathematica Slovaca
Similarity:
Displaying similar documents to “Longest circuits in triangular and quadrangular -polytopes with two types of edges”
On longest circuits in certain non-regular planar graphs
Lower bound for the size of maximal nontraceable graphs.
Frick, Marietjie, Singleton, Joy (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chromatic Index of Hamiltonian Graphs
Juraj Bosák, Jozef Fiamčík (1973)
Matematický časopis
Similarity:
Arbitrarily traceable Eulerian graph has the Hamiltonian square
Milan Sekanina, Anna Sekaninová (1982)
Archivum Mathematicum
Similarity: