Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems

DOI10.1002/jgt.21698zbMath1273.05069OpenAlexW2161405259MaRDI QIDQ2853335

Edita Máčajová, Martin Škoviera, Terry S. Griggs, Michael John Grannell

Publication date: 21 October 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21698

zbMATH Keywords

edge-coloringSteiner triple systemcubic graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)

Related Items (3)

\(H\)-colorings for 4-regular graphs ⋮ New Steiner 2-designs from old ones by paramodifications ⋮ Wilson-Schreiber Colourings of Cubic Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Fano colourings of cubic graphs and the Fulkerson conjecture
• Colouring cubic graphs by small Steiner triple systems
• Flows and generalized coloring theorems in graphs
• List edge-colorings of series-parallel graphs
• Colouring of cubic graphs by Steiner triple systems
• Covering all triples on n marks by disjoint Steiner systems
• Topology of series-parallel networks
• Projective, affine, and abelian colorings of cubic graphs
• Wilson-Schreiber Colourings of Cubic Graphs
• Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs
• A Steiner triple system which colors all cubic graphs
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems