Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement
From MaRDI portal
Publication:2434725
DOI10.1016/j.dam.2013.06.028zbMath1282.05040OpenAlexW2057583303MaRDI QIDQ2434725
Publication date: 7 February 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.06.028
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The b-chromatic number of cubic graphs
- On \(b\)-colorings in regular graphs
- The b-chromatic number of a graph
- Bi-complement reducible graphs
- Some bounds for the \(b\)-chromatic number of a graph
- On the \(b\)-chromatic number of regular graphs
- Bounds for the b-chromatic number of some families of graphs
- On the \(b\)-dominating coloring of graphs
- Upper bounds on the b-chromatic number and results for restricted graph classes
- Handbook of Graph Theory
- BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION