On the \(b\)-coloring of \(P_{4}\)-tidy graphs
From MaRDI portal
Publication:617902
DOI10.1016/j.dam.2010.10.002zbMath1227.05149OpenAlexW2049102291MaRDI QIDQ617902
Ivo Koch, Clara Inés Betancur Velasquez, Flavia Bonomo-Braberman
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
Related Items (12)
\(b\)-continuity and the lexicographic product of graphs ⋮ The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity ⋮ 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 ⋮ On quasi-monotonous graphs ⋮ A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs ⋮ On the \(b\)-chromatic number of regular graphs without 4-cycle ⋮ Partitioning extended \(P_4\)-laden graphs into cliques and stable sets ⋮ \(b\)-coloring of tight graphs ⋮ The \(b\)-chromatic index of graphs ⋮ The \(b\)-chromatic index of direct product of graphs
Cites Work
- The b-chromatic number of cubic graphs
- On minimally \(b\)-imperfect graphs
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs
- Complement reducible graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- The b-chromatic number of a graph
- On the \(p\)-connectedness of graphs---a survey
- On the structure of graphs with few \(P_4\)s
- Maximization coloring problems on graphs with few \(P_4\)
- Bounds for the b-chromatic number of some families of graphs
- On the \(b\)-dominating coloring of graphs
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- A New Class of Brittle Graphs
- P-Components and the Homogeneous Decomposition of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the \(b\)-coloring of \(P_{4}\)-tidy graphs
