Pages that link to "Item:Q972332"
From MaRDI portal
The following pages link to A new characterization of \(P_{6}\)-free graphs (Q972332):
Displayed 7 items.
- A new characterization of \(P_k\)-free graphs (Q300476) (← links)
- The price of connectivity for dominating set: upper bounds and complexity (Q406321) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- Partitioning graphs into connected parts (Q1034603) (← links)
- A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- Partitioning Graphs into Connected Parts (Q3392949) (← links)