b-colouring outerplanar graphs with large girth

DOI10.1016/J.DISC.2012.01.035zbMATH Open1242.05098OpenAlexW2024935558MaRDI QIDQ418884FDOQ418884

Authors: Frédéric Maffray, Ana Silva 

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

Recommendations

• \(b\)-coloring graphs with girth at least 8
• \(b\)-colouring the Cartesian product of trees and some other graphs
• Graphs of girth at least 7 have high \(b\)-chromatic number
• The \(b\)-continuity of graphs with large girth
• Edge-\(b\)-coloring trees

zbMATH Keywords

exact algorithmouterplanar graphs\(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)

Cites Work

• Graph theory
• The b-chromatic number of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(B\)-chromatic number of cacti

Cited In (10)

• The \(b\)-chromatic number and related topics -- a survey
• Coloring of graphs associated with commutative rings
• Some results on the the \(b\)-chromatic number in complementary prism graphs
• The \(b\)-chromatic index of graphs
• The \(b\)-chromatic index of direct product of graphs
• Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs
• Bounded colorings of outerplanar graphs
• \(B\)-chromatic number of cacti
• On b-acyclic chromatic number of a graph
• \(b\)-continuity and partial Grundy coloring of graphs with large girth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418884)