Excess in critical graphs

DOI10.1016/0095-8956(75)90058-1zbMath0298.05118OpenAlexW2091258909MaRDI QIDQ1214433

S. Singh

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(75)90058-1

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On constructive methods in the theory of colour-critical graphs ⋮ On the edge-density of 4-critical graphs ⋮ A new lower bound on the number of edges in colour-critical graphs and hypergraphs ⋮ On the critical point-arboricity graphs ⋮ Some results in topological graph theory ⋮ A list version of Dirac's theorem on the number of edges in colour-critical graphs

Cites Work

• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• On Dirac's Generalization of Brooks' Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Excess in critical graphs