Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems
From MaRDI portal
Publication:2853335
DOI10.1002/jgt.21698zbMath1273.05069MaRDI QIDQ2853335
Martin Škoviera, Edita Máčajová, 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
Related Items
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