Triangle-free Uniquely 3-Edge Colorable Cubic Graphs

2015/04/07 by sarah‐marie belcastro, Ruth Haas · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #graph theory and CDMA systems #Combinatorics #Mathematics #Enhanced Data Rates for GSM Evolution #Cubic graph #Graph #Computer science #Line graph #Artificial intelligence #Voltage graph

paper · doi:10.11575/cdm.v10i2.62320

openalex publication_date 2015/04/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Uniquely colorable graph [wikipedia]

Related

• Triangle-free Uniquely 3-Edge Colorable Cubic Graphs
• 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