b-coloring graphs with girth at least 8

MaRDI QIDQ5419985zbMATH OpenFDO

Authors

Publication date 11 June 2014

zbMATH Keywords

girth\(b\)-coloring\(b\)-chromatic number\(m\)-degree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• Graphs of girth at least 7 have high \(b\)-chromatic number
• The \(b\)-continuity of graphs with large girth
• \(b\)-colouring outerplanar graphs with large girth
• Graphs with large girth are \(b\)-continuous
• \(b\)-continuity and partial Grundy coloring of graphs with large girth

Cited in

(8)

• scientific article; zbMATH DE number 5008682 (Why is no real title available?)
• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
• Graphs with girth at least 8 are b-continuous
• \(b\)-colouring outerplanar graphs with large girth
• Upper and lower bounds based on linear programming for the b-coloring problem
• Graphs of girth at least 7 have high \(b\)-chromatic number
• Graphs with large girth are \(b\)-continuous
• On the b-coloring of tight graphs

This page was built for publication: \(b\)-coloring graphs with girth at least 8

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