Triangle-free Uniquely 3-Edge Colorable Cubic Graphs

2015/08/27 by sarah‐marie belcastro, Belcastro, Sarah-Marie, Ruth Haas +1
Computer Science · Engineering · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1508.06934

Abstract

This paper presents infinitely many new examples of triangle-free uniquely 3-edge colorable cubic graphs. The only such graph previously known was given by Tutte in 1976.

Related

• Spiral Chains: The Proofs of Tait's and Tutte's Three-Edge-Coloring Conjectures
• On measures of edge-uncolorability of cubic graphs: A brief survey and some new results
• Diamond-free, claw-free cubic graphs are (1, 1, 2, 3)-packing colorable
• A diamond-free claw-free cubic graph with strong chromatic index 7
• The square of a planar cubic graph is 7-colorable