B-coloring of m-tight graphs

DOI10.1016/J.ENDM.2009.11.035zbMATH Open1268.05084OpenAlexW2038387047MaRDI QIDQ2840540FDOQ2840540

Authors: Cláudia L. Sales, L. Sampaio 

Publication date: 19 July 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.035

Recommendations

• \(b\)-coloring of tight graphs
• On the b-coloring of tight graphs
• A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs
• scientific article; zbMATH DE number 1953103
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture

zbMATH Keywords

graph coloring\(b\)-coloringprecoloring extension\(m\)-tight graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• The b-chromatic number of a graph
• Title not available (Why is that?)
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• Bounds for the b-chromatic number of some families of graphs
• Precoloring Extension III: Classes of Perfect Graphs
• Precoloring extension on chordal graphs

Cited In (7)

• The \(b\)-chromatic number and related topics -- a survey
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
• Some results on the the \(b\)-chromatic number in complementary prism graphs
• \(b\)-coloring of tight graphs
• On the b-coloring of tight graphs
• A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs
• A note on approximating the \(b\)-chromatic number

This page was built for publication: \(B\)-coloring of \(m\)-tight graphs

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