Premium
A short proof of a theorem of dirac's about hadwiger's conjecture
Author(s) -
Woodall D. R.
Publication year - 1992
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190160109
Subject(s) - mathematics , conjecture , combinatorics , vertex (graph theory) , dirac (video compression format) , discrete mathematics , graph , quantum mechanics , physics , neutrino
A Short proof is given of the theorem that every grph that does not have K 4 as a subcontraction is properly vertex 3‐colorable.