Pages that link to "Item:Q1408827"
From MaRDI portal
The following pages link to Splitting a graph into disjoint induced paths or cycles. (Q1408827):
Displaying 10 items.
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- Extremal values and bounds for the zero forcing number (Q317429) (← links)
- Reprint of: ``Grid representations and the chromatic number'' (Q390168) (← links)
- Fast-mixed searching and related problems on graphs (Q393051) (← links)
- Induced-path partition on graphs with special blocks (Q868947) (← links)
- The parameterized complexity landscape of finding 2-partitions of digraphs (Q2330099) (← links)
- Grid representations and the chromatic number (Q2391545) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- Induced path factors of regular graphs (Q6055940) (← links)
