Restricted coloring problems on graphs with few
From MaRDI portal
Publication:2840684
DOI10.1016/j.endm.2011.05.011zbMath1268.05194MaRDI QIDQ2840684
Cláudia Linhares Sales, K. Maia, Victor A. Campos, Nícolas A. Martins, Rudini Menezes 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
acyclic chromatic number; star chromatic number; harmonious chromatic number; polynomial time algorithms; \((q; q; \(P_{4}\)-tidy graphs; 4)\)-graphs; 4q; greedy colorings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the structure of graphs with few \(P_4\)s
- Achromatic number is NP-complete for cographs and interval graphs
- Coloring with no 2-colored \(P_4\)'s
- The harmonious coloring problem is NP-complete for interval and permutation graphs
- Grundy number on -classes
- Star coloring of graphs
- On-line and first fit colorings of graphs
- Efficient algorithms for graphs with few \(P_4\)'s