Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.IsTree.coloringTwo

{V : Type u_1} → {G : SimpleGraph V} → G.IsTree → G.Coloring (Fin 2)

Arbitrary coloring with two colors for a tree

Defined in
Mathlib.Combinatorics.SimpleGraph.Acyclic
Cited by
1 results in Mathlib
Foundations
Depth 95 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.IsTree.isBipartite · cited by 0IsTree.isBipartiteSimpleGraph · cited by 3072SimpleGraphNonempty.some · cited by 340Nonempty.someSimpleGraph.Coloring · cited by 44SimpleGraph.ColoringSimpleGraph.IsTree · cited by 32SimpleGraph.IsTreeSimpleGraph.IsTree.coloringTwoOfVert · cited by 0IsTree.coloringTwoOfVertIsTree.coloringTwoCITED BYCITES

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.