A characterization of b-chromatic and partial Grundy numbers by induced subgraphs
Authors:
- Brice EffantinBEBrice Effantin
- Nicolas GastineauNGNicolas Gastineau
- Olivier TogniOTOlivier Togni
- 1 August 2016
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 339 (8) , 2157-2167
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Graphs of girth at least 7 have high b-chromatic numberEuropean Journal of Combinatorics, 2015
- On edge-b-critical graphsDiscrete Applied Mathematics, 2015
- Bounds for the-chromatic number ofDiscrete Applied Mathematics, 2013
- On vertex b-critical treesOpuscula Mathematica, 2013
- -coloring of tight graphsDiscrete Applied Mathematics, 2012
- A Characterization of b‐Perfect GraphsJournal of Graph Theory, 2011
- On the b-chromatic number of regular graphsDiscrete Applied Mathematics, 2011
- On the b-continuity property of graphsDiscrete Applied Mathematics, 2007
- On the b-dominating coloring of graphsDiscrete Applied Mathematics, 2005
- On-line 3-chromatic graphs - II critical graphsDiscrete Mathematics, 1997