Star 7-Edge-Colorability of 10-Vertex Subcubic Graphs with a 2-Factor
ProvedOPG37271.subcubic_ten_with_two_factor_hasStarEdgeColoring_sevencombinatoricscubic-graphsedge-coloringgraph-theory
Every subcubic simple graph on vertices containing a -regular spanning subgraph (a -factor, regardless of cycle partition , , , , or ) admits a star -edge-coloring.
Preamble
import Definitions.Def_opg37271_star_edge_coloring namespace OPG37271
Formal statement
theorem subcubic_ten_with_two_factor_hasStarEdgeColoring_seven
(G T : SimpleGraph (Fin 10)) (hsub : IsSubcubic G) (hTG : T ≤ G)
(h2reg : ∀ v : Fin 10, (T.neighborSet v).encard = 2) :
HasStarEdgeColoring G 7 := by sorry
end OPG37271Source
Base 10-vertex case for Dvořák, Mohar, and Šámal, Star chromatic index, J. Graph Theory 72 (2013), 313–326 (arXiv:1011.3376), Section 4.