Pages that link to "Item:Q2448964"
From MaRDI portal
The following pages link to Decomposing graphs into paths of fixed length (Q2448964):
Displaying 16 items.
- Decompositions of highly connected graphs into paths of any given length (Q324373) (← links)
- On path decompositions of \(2k\)-regular graphs (Q324765) (← links)
- Decompositions of highly connected graphs into paths of length five (Q324786) (← links)
- Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree (Q345073) (← links)
- Decomposing highly edge-connected graphs into paths of any given length (Q345101) (← links)
- The weak 3-flow conjecture and the weak circular flow conjecture (Q412176) (← links)
- Decomposing a graph into bistars (Q463290) (← links)
- On a theorem of Mader (Q1197013) (← links)
- Decomposing graphs into paths and trees (Q1690003) (← links)
- Decomposing highly connected graphs into paths of length five (Q1752489) (← links)
- A proof of the Barát-Thomassen conjecture (Q1989951) (← links)
- Spanning trees and spanning Eulerian subgraphs with small degrees (Q2342618) (← links)
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs (Q2357785) (← links)
- On path decompositions of \(2 k\)-regular graphs (Q2400577) (← links)
- Edge-partitioning 3-edge-connected graphs into paths (Q2673486) (← links)
- Edge‐decomposing graphs into coprime forests (Q6055926) (← links)
