Theorems · Definition · combinatorics
SimpleGraph.Coloring
{V : Type u} → SimpleGraph V → Type v → Type (max u v)An α-coloring of a simple graph G is a homomorphism of G into the complete graph on α.
This is also known as a proper coloring.
- Cited by
- 44 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Homproof · cited by 139
- SimpleGraph.completeGraphproof · cited by 49
Cited by76
Results whose statement or proof uses this declaration.
- SimpleGraph.Colorableproof · cited by 67
- SimpleGraph.Coloring.colorablestatement and proof · cited by 12
- SimpleGraph.Coloring.validstatement and proof · cited by 11
- SimpleGraph.Coloring.colorClassstatement and proof · cited by 6
- SimpleGraph.Coloring.colorClassesstatement and proof · cited by 6
- SimpleGraph.colorable_zero_iffproof · cited by 4
- SimpleGraph.recolorOfCardLEstatement · cited by 4
- SimpleGraph.selfColoringstatement · cited by 4
- SimpleGraph.Coloring.sumstatement and proof · cited by 4
- SimpleGraph.chromaticNumber_topproof · cited by 4
- SimpleGraph.recolorOfEquivstatement and proof · cited by 3
- SimpleGraph.Coloring.mkstatement · cited by 3