Reducibility of a degree-2 vertex in a triangle for star 7-edge-coloring
ProvedOPG37271.hasStarEdgeColoring_of_triangle_deg_twocombinatoricsedge-coloringgraph-theory
Let be a finite subcubic simple graph containing a triangle in which has degree at most . If admits a star -edge-coloring, then also admits a star -edge-coloring.
Preamble
import Definitions.Def_opg37271_star_edge_coloring import Mathlib.Combinatorics.SimpleGraph.DeleteEdges universe u namespace OPG37271
Formal statement
theorem hasStarEdgeColoring_of_triangle_deg_two {V : Type u} [Fintype V] {G : SimpleGraph V}
(hsub : IsSubcubic G) (x y z : V)
(hxz : G.Adj x z) (hyz : G.Adj y z) (hxy : G.Adj x y)
(hz2 : (G.neighborSet z).encard ≤ 2)
(hc' : HasStarEdgeColoring (G.deleteEdges {s(x, z)}) 7) :
HasStarEdgeColoring G 7 := by sorry
end OPG37271Source
Dvořák, Mohar, and Šámal, Star chromatic index, J. Graph Theory 72 (2013), 313–326 (arXiv:1011.3376), Section 4, proof of Theorem 4.1(a) (degree-2 vertex with adjacent neighbors).