Graphs in which Every Finite Path is Contained in a Circuit.
G.A. Dirac, G. Thomassen (1973)
Mathematische Annalen
Similarity:
Displaying similar documents to “On Systems of Paths and Circuits in Graphs.”
Graphs in which Every Finite Path is Contained in a Circuit.
A Family of Path Properties for Graphs.
E.L. Wilson, R.L. Hemminger, M.D. Plummer (1972)
Mathematische Annalen
Similarity:
On the Connectivity of Total Graphs.
Takashi Hamada, Toshio Nonaka, Izumi Yoshimura (1972)
Mathematische Annalen
Similarity:
A contraction theorem for abstract graphs.
G.A. DIRAC (1961)
Mathematische Annalen
Similarity:
The Connectivity of Line-Graphs.
G. CHARTRAND, M.J. STEWART (1969)
Mathematische Annalen
Similarity:
Homomorphism Theorems for Graphs.
G.A. DIRAC (1964)
Mathematische Annalen
Similarity:
The Number of Graphs on Many Unlabelled Nodes.
E.M. WRIGHT (1969)
Mathematische Annalen
Similarity:
On the Line-connectivity of Line-graphs.
Tudor ZAMFIRESCU (1970)
Mathematische Annalen
Similarity:
Polynomial Aprroximation on Graphs.
A.G. O'Farrell, K.J. Preskenis, D. Walsh (1984)
Mathematische Annalen
Similarity:
Arithmetical graphs.
Dino J. Lorenzini (1989)
Mathematische Annalen
Similarity:
Graphs which are locally Grassmann.
Richard Weiss (1993)
Mathematische Annalen
Similarity:
Functions with the Darboux Property and Functions with Connected Graphs.
S. MARCUS (1960)
Mathematische Annalen
Similarity:
On Randomly Hamiltonian Graphs.
Carsten Thomassen (1973)
Mathematische Annalen
Similarity: