Pages that link to "Item:Q490171"
From MaRDI portal
The following pages link to Restricted coloring problems on graphs with few \(P_4\)'s (Q490171):
Displaying 12 items.
- Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- PSPACE-completeness of two graph coloring games (Q2182325) (← links)
- Maximization coloring problems on graphs with few \(P_4\) (Q2448891) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
- Restricted coloring problems on graphs with few \(P'_4s\) (Q2840684) (← links)
- (Q5874489) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)