Chromatic index determined by fractional chromatic index

DOI10.1016/j.jctb.2018.01.006zbMath1387.05083arXiv1606.07927OpenAlexW2963917233MaRDI QIDQ1748268

Luke Postle, Ringi Kim, Songling Shan, Guantao Chen, Yu-ping Gao

Publication date: 9 May 2018

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

critical graphTashkinov treefractional chromatic indexedge chromatic indexextended Tashkinov tree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ Graph edge coloring: a survey ⋮ Goldberg's conjecture is true for random multigraphs ⋮ Structural properties of edge-chromatic critical multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the chromatic index of multigraphs
• On the chromatic index of multigraphs without large triangles
• Graph edge colouring: Tashkinov trees and Goldberg's conjecture
• Asymptotics of the chromatic index for multigraphs
• Some remarks on the chromatic index of a graph
• Edge-coloring of multigraphs: Recoloring technique
• On the $1.1$ Edge-Coloring of Multigraphs
• The NP-Completeness of Edge-Coloring
• On edge-colorings of graphs.
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Maximum matching and a polyhedron with 0,1-vertices
• Two Theorems on Pseudosymmetric Graphs
• A Theorem on Coloring the Lines of a Network

This page was built for publication: Chromatic index determined by fractional chromatic index