Pages that link to "Item:Q4443116"
From MaRDI portal
The following pages link to Graph Subcolorings: Complexity and Algorithms (Q4443116):
Displaying 17 items.
- Path-bicolorable graphs (Q659746) (← links)
- On star and caterpillar arboricity (Q1025569) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← 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)
- Near-colorings: non-colorable graphs and NP-completeness (Q2260631) (← links)
- 2-subcoloring is NP-complete for planar comparability graphs (Q2404616) (← links)
- Coloring subgraphs with restricted amounts of hues (Q2406596) (← links)
- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs (Q2864316) (← links)
- SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS (Q3063603) (← links)
- On some arboricities in planar graphs (Q3439376) (← links)
- Trees, Paths, Stars, Caterpillars and Spiders (Q3467870) (← links)
- Path-Bicolorable Graphs (Q3655151) (← links)
- (Q5009615) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)