Combinatorics / CONCEPT
Coloring extensions and degree reduction
Odd closed walks contain odd cycles; finite graphs admit the greedy degree bound and color-preserving vertex extensions.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS0
The greedy maximum-degree bound
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
- Brooks' theorem and connected exceptionsstructural-affinity · Closed
- Characterizing well-covered Cayley squaresstructural-affinity · Closed
- Clique and odd-cycle surgerystructural-affinity · Closed
- Clique color extensionsstructural-affinity · Closed
- Coloring Hereditarily Sparse Graphsstructural-affinity · Closed
- Components and Vertex Cutsstructural-affinity · Closed
- Deterministic Rainbow Two-Edge Choicesstructural-affinity · Closed
- Greedy Coloring and Vertex Extensionsstructural-affinity · Closed
- Rainbow Rank Descent with a Reserved Final Edgestructural-affinity · Closed
- Subcubic Brooks Theoremstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance