The number of edges in critical graphs.
G.A. Dirac (1974)
Journal für die reine und angewandte Mathematik
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A new proof of a theorem of Dirac on the number of edges in critical graphs.”
The number of edges in critical graphs.
On the structure of 5- and 6-chromatic abstract graphs.
G.A. Dirac (1964)
Journal für die reine und angewandte Mathematik
Similarity:
Operations on directed graphs.
Jürgen Eufinger (1971)
Journal für die reine und angewandte Mathematik
Similarity:
Minimally 2-connected graphs.
G.A. Dirac (1967)
Journal für die reine und angewandte Mathematik
Similarity:
An extremal result for graphs with an application to their colourings.
G.A. Dirac, B. Toft, B. A. Sorensen (1974)
Journal für die reine und angewandte Mathematik
Similarity:
Locally k-degenerate graphs: a definition and two conjectures.
J.M.S. Simoes-Pereira (1978)
Journal für die reine und angewandte Mathematik
Similarity:
Minimally n-line connected graphs.
Don R. Lick (1972)
Journal für die reine und angewandte Mathematik
Similarity:
On the total coloring of planar graphs.
O.V. Borodin (1989)
Journal für die reine und angewandte Mathematik
Similarity:
Proof of Simoes-Pereira's conjectures on locally k-degenerate graphs.
O.V. Borodin (1980)
Journal für die reine und angewandte Mathematik
Similarity:
Special generalized Gauss graphs and their application to minimization of functional involving curvatures.
Silvano Delladio (1997)
Journal für die reine und angewandte Mathematik
Similarity:
Characerization of a class of distance regular graphs.
A. Neumaier (1985)
Journal für die reine und angewandte Mathematik
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.
Graphs in which every path is contained in a Hamilton path.
Carsten Thomassen (1974)
Journal für die reine und angewandte Mathematik
Similarity: