Graphs with girth at least 8 are b-continuous

DOI10.1016/j.entcs.2019.08.059OpenAlexW2977943097WikidataQ113317370 ScholiaQ113317370MaRDI QIDQ2132404

Yanyan Li

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.059

zbMATH Keywords

bipartite graphsgirthb-chromatic numberb-continuity

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(b\)-coloring of Kneser graphs
• On \(b\)-colorings in regular graphs
• The b-chromatic number of a graph
• The \(b\)-continuity of graphs with large girth
• \(b\)-coloring of tight graphs
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
• On the \(b\)-chromatic number of regular graphs
• Graphs of girth at least 7 have high \(b\)-chromatic number
• On the \(b\)-continuity property of graphs

This page was built for publication: Graphs with girth at least 8 are b-continuous