Short Fans and the 5/6 Bound for Line Graphs

DOI10.1137/16M1099030zbMath1370.05061arXiv1610.03924MaRDI QIDQ5357961

Landon Rabern, Daniel W. Cranston

Publication date: 18 September 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.03924

zbMATH Keywords

multigraphedge-coloringGoldberg-Seymour conjectureTashkinov tree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Graph edge coloring: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A superlocal version of Reed's conjecture
• A strengthening of Brooks' Theorem for line graphs
• Graph edge colouring: Tashkinov trees and Goldberg's conjecture
• Edge-coloring of multigraphs: Recoloring technique
• On edge-colorings of graphs.
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs
• A Theorem on Coloring the Lines of a Network

This page was built for publication: Short Fans and the 5/6 Bound for Line Graphs