On the Connectivity of Total Graphs.
Takashi Hamada, Toshio Nonaka, Izumi Yoshimura (1972)
Mathematische Annalen
Similarity:
Displaying similar documents to “On Separating Sets of Edges in Contraction-Critical Graphs.”
On the Connectivity of Total Graphs.
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:
On Systems of Paths and Circuits in Graphs.
G.A. Dirac (1973)
Mathematische Annalen
Similarity:
The Number of Graphs on Many Unlabelled Nodes.
E.M. WRIGHT (1969)
Mathematische Annalen
Similarity:
Homomorphism Theorems for Graphs.
G.A. DIRAC (1964)
Mathematische Annalen
Similarity:
On the Line-connectivity of Line-graphs.
Tudor ZAMFIRESCU (1970)
Mathematische Annalen
Similarity:
Graphs in which Every Finite Path is Contained in a Circuit.
G.A. Dirac, G. Thomassen (1973)
Mathematische Annalen
Similarity:
A Family of Path Properties for Graphs.
E.L. Wilson, R.L. Hemminger, M.D. Plummer (1972)
Mathematische Annalen
Similarity:
Total domination edge critical graphs with maximum diameter
Lucas C. van der Merwe, Cristine M. Mynhardt, Teresa W. Haynes (2001)
Discussiones Mathematicae Graph Theory
Similarity:
Denote the total domination number of a graph G by γₜ(G). A graph G is said to be total domination edge critical, or simply γₜ-critical, if γₜ(G+e) < γₜ(G) for each edge e ∈ E(G̅). For 3ₜ-critical graphs G, that is, γₜ-critical graphs with γₜ(G) = 3, the diameter of G is either 2 or 3. We characterise the 3ₜ-critical graphs G with diam G = 3.
Polynomial Aprroximation on Graphs.
A.G. O&amp;#039;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: