b-coloring of some bipartite graphs
From MaRDI portal
Recommendations
- On lower bounds for the b-chromatic number of connected bipartite graphs
- Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement
- On the \(b\)-coloring of \(G - e\)
- Bounds for the b-chromatic number of G-v
- Upper bounds on the b-chromatic number and results for restricted graph classes
Cited in
(22)- The b-chromatic number and related topics -- a survey
- b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
- Bounds for the b-chromatic number of some families of graphs
- A characterization of b-chromatic and partial Grundy numbers by induced subgraphs
- Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement
- Colorings of b-simple hypergraphs
- scientific article; zbMATH DE number 7034041 (Why is no real title available?)
- Sum coloring of bipartite graphs with bounded degree
- A note on the bichromatic numbers of graphs
- Role coloring bipartite graphs
- On b-coloring of central graph of some graphs
- Balanced coloring of bipartite graphs
- A note on transformations of edge colorings of bipartite graphs
- Bounds for the b-chromatic number of subgraphs and edge-deleted subgraphs
- On the \(b\)-coloring of \(G - e\)
- On coloring the arcs of biregular graphs
- Grundy coloring in some subclasses of bipartite graphs and their complements
- Path colorings in bipartite graphs
- \([r,s,t]\)-coloring of trees and bipartite graphs
- Some problems on idomatic partitions and b-colorings of direct products of complete graphs
- scientific article; zbMATH DE number 7141490 (Why is no real title available?)
- On lower bounds for the b-chromatic number of connected bipartite graphs
This page was built for publication: \(b\)-coloring of some bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906843)
