Combinatorics / CONCEPT
Subcubic Brooks Theorem
Every finite simple graph with maximum degree at most three and no four-clique admits a proper three-coloring.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS1
Three Colors for Subcubic Graphs
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A Good Triple from a Two-Vertex Cutstructural-affinity · Closed
- A nearly empty Cartesian layerstructural-affinity · Closed
- Coloring extensions and degree reductionstructural-affinity · Closed
- Coloring Hereditarily Sparse Graphsstructural-affinity · Closed
- Components and Vertex Cutsstructural-affinity · Closed
- Connected encoder classes and powers of threestructural-affinity · Closed
- Deterministic Rainbow Two-Edge Choicesstructural-affinity · Closed
- Greedy Coloring and Vertex Extensionsstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance