Pages that link to "Item:Q1603517"
From MaRDI portal
The following pages link to The NP-completeness of (1,r)-subcolorability of cubic graphs (Q1603517):
Displaying 9 items.
- More about subcolorings (Q424720) (← links)
- The complexity of some acyclic improper colourings (Q533784) (← links)
- On the hardness of computing span of subcubic graphs (Q888955) (← links)
- Deciding whether a planar graph has a cubic subgraph is NP-complete (Q1318823) (← links)
- Stable-\(\Pi\) partitions of graphs (Q2255049) (← links)
- 2-subcoloring is NP-complete for planar comparability graphs (Q2404616) (← links)
- Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
- Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)
- Decomposing subcubic graphs into claws, paths or triangles (Q6056758) (← links)