Incidence coloring of graphs with high maximum average degree
From MaRDI portal
Publication:2357131
DOI10.1016/j.dam.2017.04.029zbMath1365.05083arXiv1412.6803OpenAlexW2962785846MaRDI QIDQ2357131
Marthe Bonamy, Samia Kerdjoudj, Hervé Hocquard, Andre Raspaud
Publication date: 19 June 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.6803
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Incidence and strong edge colorings of graphs
- On incidence coloring and star arboricity of graphs
- The incidence coloring conjecture for graphs of maximum degree 3
- The star arboricity of graphs
- Incidence coloring of \(k\)-degenerated graphs
- 2-Distance Coloring of Sparse Graphs