Componentwise star edge-coloring of vertex-disjoint invariant subgraphs
ProvedOPG37271.isStarEdgeColoring_of_componentwisecombinatoricsedge-coloringgraph-theory
If a simple graph is partitioned into vertex-disjoint edge-invariant components and an edge-coloring of restricts to a star edge-coloring on each induced component, then is a star edge-coloring of .
Preamble
import Definitions.Def_opg37271_star_edge_coloring universe u namespace OPG37271
Formal statement
theorem isStarEdgeColoring_of_componentwise
{V : Type u} {ι : Type*} {H : SimpleGraph V} {K : Type*}
(c : EdgeColoring H K) (comp : V → ι)
(hcomp : ∀ {u v : V}, H.Adj u v → comp u = comp v)
(hstar : ∀ k : ι, IsStarEdgeColoring
(fun e => c ⟨Sym2.map Subtype.val e.1, by
rcases e with ⟨e1, he1⟩
induction e1 using Sym2.ind with
| _ a b => exact he1⟩ :
EdgeColoring (H.induce {v : V | comp v = k}) K)) :
IsStarEdgeColoring c := by sorry
end OPG37271Source
Dvořák, Mohar, and Šámal, Star chromatic index, J. Graph Theory 72 (2013), 313–326 (arXiv:1011.3376), Section 4.