Graphs of girth at least 7 have high \(b\)-chromatic number

DOI10.1016/j.ejc.2015.02.017zbMath1315.05048OpenAlexW2070594029MaRDI QIDQ2346588

Yanyan Li

Publication date: 2 June 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2015.02.017

zbMATH Keywords

polynomial algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs ⋮ Graphs with girth at least 8 are b-continuous ⋮ The \(b\)-chromatic number and related topics -- a survey ⋮ \(b\)-continuity and partial Grundy coloring of graphs with large girth ⋮ The \(b\)-continuity of graphs with large girth ⋮ On the \(b\)-continuity of the lexicographic product of graphs ⋮ On b-acyclic chromatic number of a graph ⋮ Edge-\(b\)-coloring trees ⋮ New bounds for the \(b\)-chromatic number of vertex deleted graphs ⋮ Graphs with large girth are \(b\)-continuous ⋮ A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs ⋮ A complexity dichotomy for critical values of the b-chromatic number of graphs

Cites Work

• Unnamed Item
• On the \(b\)-chromatic number of regular graphs without 4-cycle
• On \(b\)-colorings in regular graphs
• On the combinatorial problems which I would most like to see solved
• The b-chromatic number of a graph
• \(b\)-coloring of tight graphs
• \(b\)-colouring the Cartesian product of trees and some other graphs
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
• On the \(b\)-chromatic number of regular graphs

This page was built for publication: Graphs of girth at least 7 have high \(b\)-chromatic number