On the b-coloring of P₄-tidy graphs

DOI10.1016/J.DAM.2010.10.002MaRDI QIDQ617902zbMATH OpenOpenAlexFDO

Authors Clara Inés Betancur Velasquez, Ivo Koch, Flavia Bonomo

Publication date 14 January 2011

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

Full work available at URL https://doi.org/10.1016/j.dam.2010.10.002

zbMATH Keywords

\(b\)-coloring\(b\)-continuity\(b\)-monotonicity\(P_{4}\)-tidy graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• \(b\)-coloring of tight graphs
• Upper bounds on the b-chromatic number and results for restricted graph classes

Cites work

• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• A New Class of Brittle Graphs
• Bounds for the b-chromatic number of some families of graphs
• Complement reducible graphs
• scientific article; zbMATH DE number 3896983 (Why is no real title available?)
• scientific article; zbMATH DE number 1375569 (Why is no real title available?)
• scientific article; zbMATH DE number 1953103 (Why is no real title available?)
• scientific article; zbMATH DE number 1919512 (Why is no real title available?)
• Maximization coloring problems on graphs with few \(P_4\)
• On a unique tree representation for \(P_ 4\)-extendible graphs
• On minimally \(b\)-imperfect graphs
• On the \(b\)-dominating coloring of graphs
• On the \(p\)-connectedness of graphs---a survey
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• On the structure of graphs with few P₄s
• P-Components and the Homogeneous Decomposition of Graphs
• The b-chromatic number of a graph
• The b-chromatic number of cubic graphs

Cited in

(20)

• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• The b-chromatic number and related topics -- a survey
• The \(b\)-continuity of graphs with large girth
• On the \(b\)-continuity of the lexicographic product of graphs
• \(b\)-coloring of tight graphs
• Neighborhood covering and independence on P₄-tidy graphs and tree-cographs
• The \(b\)-chromatic index of graphs
• The \(b\)-chromatic index of direct product of graphs
• The lexicographic product of some chordal graphs and of cographs preserves b-continuity
• A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs
• Minimal separators in P₄-tidy graphs
• b-continuity and the lexicographic product of graphs
• On the \(b\)-chromatic number of regular graphs without 4-cycle
• Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
• scientific article; zbMATH DE number 5879543 (Why is no real title available?)
• \(b\)-coloring parameterized by clique-width
• On z-coloring and \(\mathrm{b}^\ast \)-coloring of graphs as improved variants of the b-coloring
• Structural parameterizations of b-coloring
• b-coloring parameterized by clique-width
• On quasi-monotonous graphs

This page was built for publication: On the \(b\)-coloring of \(P_{4}\)-tidy graphs

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