Edge-\(b\)-coloring trees
From MaRDI portal
Publication:1702122
DOI10.1007/s00453-016-0240-xzbMath1380.05055arXiv1511.05422OpenAlexW2278716946MaRDI QIDQ1702122
Publication date: 28 February 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.05422
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Dynamic programming (90C39) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(b\)-colorings in regular graphs
- The b-chromatic number of a graph
- \(b\)-coloring of tight graphs
- Some bounds for the \(b\)-chromatic number of a graph
- On the \(b\)-chromatic number of regular graphs
- Graphs of girth at least 7 have high \(b\)-chromatic number
- The \(b\)-chromatic index of graphs