\(b\)-colouring outerplanar graphs with large girth

DOI10.1016/J.DISC.2012.01.035zbMath1242.05098OpenAlexW2024935558MaRDI QIDQ418884

J. Herrera, H. S. Yoon

Publication date: 30 May 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.01.035

zbMATH Keywords

outerplanar graphsexact algorithm\(b\)-chromatic number\(b\)-colouring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs ⋮ The \(b\)-chromatic number and related topics -- a survey ⋮ On b-acyclic chromatic number of a graph ⋮ Some results on the b-chromatic number in complementary prism graphs ⋮ The \(b\)-chromatic index of graphs ⋮ The \(b\)-chromatic index of direct product of graphs

Cites Work

• The b-chromatic number of a graph
• b-chromatic number of cacti
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(b\)-colouring outerplanar graphs with large girth