Pages that link to "Item:Q2689639"

The following pages link to Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles (Q2689639):

Displaying 8 items.

• 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)
• Covering the vertices of a digraph by cycles of prescribed length (Q1174160) (← links)
• Partitioning vertices of a tournament into independent cycles (Q1850562) (← links)
• Partition and disjoint cycles in digraphs (Q2698538) (← links)
• Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs (Q3335811) (← links)
• What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? (Q3745872) (← links)
• Disjoint Cycles in a Digraph with Partial Degree (Q5883282) (← links)