Planar graphs with girth at least 5 are (3,4)-colorable: their vertices admit a partition into a subgraph of maximum degree 3 and a subgraph of maximum degree 4.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Planar graphs with girth at least 5 are (3,4)-colorable
Planar graphs with girth at least 5 are (3,4)-colorable: their vertices admit a partition into a subgraph of maximum degree 3 and a subgraph of maximum degree 4.