On the family of \(r\)-regular graphs with Grundy number \(r+1\)
From MaRDI portal
Publication:2449171
DOI10.1016/j.disc.2014.03.023zbMath1288.05204arXiv1312.6503MaRDI QIDQ2449171
Hamamache Kheddouci, Olivier Togni, Nicolas Gastineau
Publication date: 6 May 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.6503
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Cites Work
- Unnamed Item
- First-fit chromatic numbers of \(d\)-degenerate graphs
- On the \(b\)-chromatic number of regular graphs without 4-cycle
- The b-chromatic number of cubic graphs
- Results on the Grundy chromatic number of graphs
- Grundy number and products of graphs
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- On the Grundy and \(b\)-chromatic numbers of a graph
- On the \(b\)-chromatic number of regular graphs
- An algorithm for partial Grundy number on trees
- New Bounds on the Grundy Number of Products of Graphs
- On the First-Fit Chromatic Number of Graphs
- Inequalities for the first-fit chromatic number
- Grundy number of graphs