trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Greedy Coloring and Vertex Extensions

Greedy ordering colors a connected subcubic graph with a low-degree vertex; compatible colorings also extend across a vertex or glue along a cut.

Closed Authored exposition
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES5
PROOF DEPTH0
DOCUMENT LINKS1
THEOREM

A Low-Degree Vertex in a Connected Subcubic Graph

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Greedy Coloring and Vertex ExtensionsGreedy Coloring and VertexExtensionsColoring extensions and degree reductionColoring extensions and degreereductionComponents and Vertex CutsComponents and Vertex CutsSubcubic Brooks TheoremSubcubic Brooks TheoremA nearly empty Cartesian layerA nearly empty Cartesian layerDeterministic Rainbow Two-Edge ChoicesDeterministic Rainbow Two-EdgeChoices
Proof dependencyStructural affinityDocument link

RELATED KNOWLEDGE

Structural connections

Documents & exposition

Other authored & advisory relationships

None recorded in this release.

LIBRARY / RELEASE VERSIONS

Content history

Loading release versions...
Browse the archive

Certified provenance

Exact release coordinate

Lean sourceResearch workspace
Status
Closed
Depth
0
Layer
D5/S3
Domain
Combinatorics
Node ID
D5/S3/Combinatorics/Graph/Brooks/Coloring
Repository path
D5/S3/Combinatorics/Graph/Brooks/Coloring.lean
Truth release
sha256:76a8db6a0f78609b1b9d4a959c8392f2752f2daaddc1930e046e34ce07d0f608
Source commit
b52262a023c4db9bb30a128ebfd80ea4ef4c1a53
Source tree
37a24ddf3b9983bdabf0acbfd9b32b06c35c28d3

Authority boundary

Dependency edges, status, and source coordinates come from the verified release and certified topology. Blueprint exposition is labeled separately. A fallback title carries no additional mathematical authority.