Restricted coloring problems on graphs with few P'_4s
DOI10.1016/J.ENDM.2011.05.011zbMATH Open1268.05194OpenAlexW72948258MaRDI QIDQ2840684FDOQ2840684
Authors: Victor Campos, Cláudia L. Sales, K. Maia, N. Martins, Rudini M. Sampaio 
Publication date: 23 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.2011.05.011
Recommendations
acyclic chromatic numberpolynomial time algorithms\((qstar chromatic numberharmonious chromatic numberq\(P_{4}\)-tidy graphs4)\)-graphs4qgreedy colorings
Cites Work
- Graph theory
- Coloring with no 2-colored \(P_4\)'s
- Star coloring of graphs
- Title not available (Why is that?)
- On-line and first fit colorings of graphs
- On the structure of graphs with few \(P_4\)s
- Title not available (Why is that?)
- Achromatic number is NP-complete for cographs and interval graphs
- The harmonious coloring problem is NP-complete for interval and permutation graphs
- Efficient algorithms for graphs with few \(P_4\)'s
- Grundy number on \(P_4\)-classes
Cited In (8)
- Two fixed-parameter algorithms for the cocoloring problem
- Maximization coloring problems on graphs with few \(P_4\)
- Recognition algorithm for \(P_4\)-tidy graphs
- Grundy number on \(P_4\)-classes
- On the minimum sum coloring of \(P_4\)-sparse graphs
- Restricted coloring problems on graphs with few \(P_4\)'s
- Efficient algorithms for graphs with few \(P_4\)'s
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
This page was built for publication: Restricted coloring problems on graphs with few \(P'_4s\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840684)
