A Sufficient Condition for a Graph to Be Hamiltonian.
Norbert Köhler (1981)
Monatshefte für Mathematik
Similarity:
Displaying similar documents to “In the Square of Graphs, Hamiltonicity and Pancyclicity, Hamiltonian Connectedness and Panconnectedness Are Equivalent Concepts.”
A Sufficient Condition for a Graph to Be Hamiltonian.
Special Subdivisions of K4 and 4-Chromatic Graphs.
U. Krusenstjerna-Hafstrom, B. Toft (1980)
Monatshefte für Mathematik
Similarity:
Finding EPS-Graphs.
H.T. Lau (1981)
Monatshefte für Mathematik
Similarity:
Just Two Total Graphs are Complementary.
F. Escalante, J.M.S. Simoes-Pereira (1976)
Monatshefte für Mathematik
Similarity:
Sofic Systems and Graphs.
Roland Fischer (1975)
Monatshefte für Mathematik
Similarity:
Remark on the Graphs with a Central Symmetry.
A. Kotzig, F. Glivjak, J. Plesnik (1970)
Monatshefte für Mathematik
Similarity:
On the Connectivities of Finite and Infinite Graphs.
H.A. Jung, M.E. Watkins (1977)
Monatshefte für Mathematik
Similarity:
Homomorphisms of Graphs and of Their Orientations.
P. Hell, J. Nesetril (1978)
Monatshefte für Mathematik
Similarity:
Graphs and Partial Orderings.
Martin Aigner (1969)
Monatshefte für Mathematik
Similarity:
Value-True Walks in Finite, Connected, Valuated Graphs.
H. Fleischner, P.D. Vestergaard (1977)
Monatshefte für Mathematik
Similarity:
Associative Products of Graphs.
W. Imrich, Herbert Izbicki (1975)
Monatshefte für Mathematik
Similarity:
Sense Preserving Groups of Polyhedral Graphs.
L. Babai, W. Imrich (1975)
Monatshefte für Mathematik
Similarity:
Graphs with Given Infinite Groups.
Gert Sabidussi (1960)
Monatshefte für Mathematik
Similarity: