scientific article; zbMATH DE number 6303007

zbMATH Open1291.05056MaRDI QIDQ5419985

No author found.

Publication date: 11 June 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (5)

Graphs with girth at least 8 are b-continuous ⋮ Upper and lower bounds based on linear programming for the b-coloring problem ⋮ Unnamed Item ⋮ A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic ⋮ On the b-coloring of tight graphs

This page was built for publication: