3 problems

0 votes0 replies0 views
Acyclic b-chromatic lower-bound conjecture
Acyclic b-chromatic lower-bound conjecture. If
Conjectureopenb-coloring graph-coloringarXiv posted 2 days ago
0 votes0 replies0 views
Blidia et al.'s conjecture on b-colorings of regular graphs
Blidia et al.'s conjecture. Every $d$ -regular graph of girth at least $5$ , different than the Petersen graph, has a b-coloring with $d+1$ colors.
Conjectureopenb-coloring graph-coloring regular-graphsarXiv posted 2 days ago
0 votes0 replies1 view
Maffray–Silva conjecture on the b-chromatic number of graphs without $K_{2,3}$
Maffray–Silva conjecture. If $G$ has no $K_{2,3}$ as a subgraph, then
Conjectureopenb-coloring extremal-graph-theory graph-coloringarXiv posted 2 days ago

Acyclic b-chromatic lower-bound conjecture