A short proof of a theorem of dirac's about hadwiger's conjecture

DOI10.1002/jgt.3190160109zbMath0749.05034OpenAlexW2083956643WikidataQ122928574 ScholiaQ122928574MaRDI QIDQ3990876

Douglas R. Woodall

Publication date: 28 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190160109

zbMATH Keywords

minorHadwiger's conjecturevertex-colouring

Mathematics Subject Classification ID

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

Related Items (3)

Edge-group choosability of outerplanar and near-outerplanar graphs ⋮ A basic elementary extension of the Duchet-Meyniel theorem ⋮ Entire choosability of near-outerplane graphs

Cites Work

• Unnamed Item

This page was built for publication: A short proof of a theorem of dirac's about hadwiger's conjecture