A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger

DOI10.1112/PLMS/S3-7.1.161zbMath0077.17002OpenAlexW2066843228WikidataQ56389550 ScholiaQ56389550MaRDI QIDQ3241662

G. A. Dirac

Publication date: 1957

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s3-7.1.161

zbMATH Keywords

Topology

Related Items (45)

Size, chromatic number, and connectivity ⋮ Point partition numbers: decomposable and indecomposable critical graphs ⋮ Simplicial tree-decompositions of infinite graphs. I ⋮ Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions ⋮ Brooks' Theorem and Beyond ⋮ Topology of series-parallel networks ⋮ Chromaticity of chordal graphs ⋮ On constructive methods in the theory of colour-critical graphs ⋮ The minimum number of edges in 4-critical digraphs of given order ⋮ Structure in sparse \(k\)-critical graphs ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Generalized DP-colorings of graphs ⋮ On the edge-density of 4-critical graphs ⋮ Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph ⋮ A new lower bound on the number of edges in colour-critical graphs and hypergraphs ⋮ Nonexistence of seven-dimensional tangential 2-blocks ⋮ Graph coloring satisfying restraints ⋮ Short proofs of coloring theorems on planar graphs ⋮ Dirac's map-color theorem for choosability ⋮ Ore's conjecture on color-critical graphs is almost true ⋮ A search problem on graphs which generalizes some group testing problems with two defectives ⋮ On the number of edges in hypergraphs critical with respect to strong colourings ⋮ The edge density of 4-critical planar graphs ⋮ Peakless functions on graphs ⋮ Chromatic numbers of quadrangulations on closed surfaces ⋮ Grassmann homomorphism and Hajós-type theorems ⋮ Partitioning sparse graphs into an independent set and a forest of bounded degree ⋮ A Brooks type theorem for the maximum local edge connectivity ⋮ Excess in critical graphs ⋮ Chromatic number and girth ⋮ Coloring vertices and faces of maps on surfaces ⋮ On tangential 2-blocks ⋮ Nonexistence of six-dimensional tangential 2-block ⋮ Le nombre maximal de colorations d'un graphe Hamiltonien ⋮ A Brooks-type result for sparse critical graphs ⋮ Some results in topological graph theory ⋮ Improved lower bounds on the number of edges in list critical and online list critical graphs ⋮ On the minimal number of edges in color-critical graphs ⋮ A 4-color theorem of the Klein bottle ⋮ A list version of Dirac's theorem on the number of edges in colour-critical graphs ⋮ A case of Hadwiger's conjecture ⋮ Bemerkungen zu Hadwigers Vermutung ⋮ Colour-critical graphs with few edges ⋮ A map colour theorem for the union of graphs ⋮ Sparse colour-critical hypergraphs

This page was built for publication: A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger