The following pages link to More about subcolorings (Q424720):
Displaying 11 items.
- Path-bicolorable graphs (Q659746) (← links)
- On star and caterpillar arboricity (Q1025569) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- On the algorithmic aspects of strong subcoloring (Q1752633) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- 2-subcoloring is NP-complete for planar comparability graphs (Q2404616) (← links)
- SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS (Q3063603) (← links)
- Path-Bicolorable Graphs (Q3655151) (← links)
- (Q5009615) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- On 2-Subcolourings of Chordal Graphs (Q5458558) (← links)
