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):
Displayed 4 items.
- The complexity of some acyclic improper colourings (Q533784) (← links)
- Stable-\(\Pi\) partitions of graphs (Q2255049) (← links)
- Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
- Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)