On b-vertex and b-edge critical graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1953103 (Why is no real title available?)
- About the b-continuity of graphs
- Algorithmic graph theory and perfect graphs
- Bounds for the b-chromatic number of some families of graphs
- Characterization of some \(b\)-chromatic edge critical graphs
- On b-coloring of Cartesian product of graphs.
- On \(b\)-colorings in regular graphs
- On edge-\(b\)-critical graphs
- On the \(b\)-chromatic number of regular graphs
- On the \(b\)-dominating coloring of graphs
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs
- On vertex b-critical trees
- Some bounds for the b-chromatic number of a graph
- The b-chromatic number of regular graphs via the edge-connectivity
- The b-chromatic number of a graph
- The b-chromatic number of cubic graphs
- \(B\)-chromatic number of cacti
Cited in
(10)- Edge-critical subgraphs of Schrijver graphs. II: The general case
- On edge-\(b\)-critical graphs
- A characterization of b_e-critical trees
- scientific article; zbMATH DE number 1228444 (Why is no real title available?)
- Characterization of some \(b\)-chromatic edge critical graphs
- On the critical difference of almost bipartite graphs
- On vertex b-critical trees
- On the \(sd_b\)-critical graphs
- A characterization of edge \(b\)-critical graphs
- Families of greater \(b\)-chromatic graphs
This page was built for publication: On \(b\)-vertex and \(b\)-edge critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459012)