Edge coloring multigraphs without small dense subsets
From MaRDI portal
Publication:2515595
DOI10.1016/j.disc.2015.06.022zbMath1318.05028OpenAlexW754424760MaRDI QIDQ2515595
Henry A. Kierstead, Penny E. Haxell
Publication date: 5 August 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.06.022
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (3)
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
- 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
- Achieving maximum chromatic index in multigraphs
- Asymptotics of the chromatic index for multigraphs
- On characterizing Vizing's edge colouring bound
- Edge-coloring of multigraphs: Recoloring technique
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- A Combined Logarithmic Bound on the Chromatic Index of Multigraphs
- A Theorem on Coloring the Lines of a Network
This page was built for publication: Edge coloring multigraphs without small dense subsets