Pages that link to "Item:Q1084110"
From MaRDI portal
The following pages link to Partitions of digraphs into paths or circuits (Q1084110):
Displaying 13 items.
- Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach (Q941336) (← links)
- Path partitions and packs of acyclic digraphs (Q1061135) (← links)
- Decompositions of digraphs into paths and cycles (Q1063040) (← links)
- A note about a theorem by Maamoun on decompositions of digraphs into elementary directed paths or cycles (Q1066157) (← links)
- A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs (Q1335502) (← links)
- Partitioning graphs into paths or cycles of prescribed lengths (Q1937351) (← links)
- Long cycles, heavy cycles and cycle decompositions in digraphs (Q1998760) (← links)
- Graphs with a path partition for structuring digital spaces (Q2446382) (← links)
- Partition of a travel into circuits (Q2774164) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← links)
- Paths, chains, and antipaths (Q3476568) (← links)
- What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? (Q3745872) (← links)
- (Q3808121) (← links)