Arbitrarily traceable Eulerian graph has the Hamiltonian square
Milan Sekanina, Anna Sekaninová (1982)
Archivum Mathematicum
Similarity:
Displaying similar documents to “Minimum functors on categories of Neumann trees”
Arbitrarily traceable Eulerian graph has the Hamiltonian square
A sufficient condition for Hamiltonian graphs
Ivan Polický (1995)
Mathematica Slovaca
Similarity:
Maximal nontraceable graphs with toughness less than one.
Bullock, Frank, Frick, Marietjie, Singleton, Joy, van Aardt, Susan, Mynhardt, Kieka (C.M.) (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On open Hamiltonian walks in graphs
Pavel Vacek (1991)
Archivum Mathematicum
Similarity:
Paths in powers of graph
Elena Wisztová (1980)
Časopis pro pěstování matematiky
Similarity: