Theorems · Definition · combinatorics
SimpleGraph.selfColoring
{V : Type u} → (G : SimpleGraph V) → G.Coloring VThe "tautological" coloring of a graph, using the vertices of the graph as colors.
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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.Coloringstatement · cited by 44
- SimpleGraph.ne_of_adjproof · cited by 14
- SimpleGraph.Coloring.mkproof · cited by 3
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.chromaticNumber_topproof · cited by 4
- SimpleGraph.colorable_of_fintypeproof · cited by 1
- SimpleGraph.Partition.default_defstatement · cited by 0
- SimpleGraph.chromaticNumber_le_cardproof · cited by 0