Restricted coloring problems on graphs with few P'_4s
From MaRDI portal
Recommendations
Cites work
- Achromatic number is NP-complete for cographs and interval graphs
- Coloring with no 2-colored \(P_4\)'s
- Efficient algorithms for graphs with few P₄'s
- Graph theory
- Grundy number on P₄-classes
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 2147949 (Why is no real title available?)
- On the structure of graphs with few P₄s
- On-line and first fit colorings of graphs
- Star coloring of graphs
- The harmonious coloring problem is NP-complete for interval and permutation graphs
Cited in
(8)- Maximization coloring problems on graphs with few \(P_4\)
- Grundy number on P₄-classes
- Two fixed-parameter algorithms for the cocoloring problem
- Recognition algorithm for P₄-tidy graphs
- Restricted coloring problems on graphs with few P₄'s
- Efficient algorithms for graphs with few P₄'s
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
- On the minimum sum coloring of P₄-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)