Pages that link to "Item:Q1101126"

The following pages link to Directed cut transversal packing for source-sink connected graphs (Q1101126):

Displaying 10 items.

• Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
• Intersection properties of maximal directed cuts in digraphs (Q329544) (← links)
• Packing and covering of crossing families of cuts (Q789399) (← links)
• A family of perfect graphs associated with directed graphs (Q796547) (← links)
• Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738) (← links)
• Complexity of packing common bases in matroids (Q2039228) (← links)
• Packing in generalized kernel systems: a framework that generalizes packing of branchings (Q2515040) (← links)
• Note on a min-max conjecture of Woodall (Q2746483) (← links)
• Disjoint dijoins for classes of dicuts in finite and infinite digraphs (Q5051459) (← links)
• On Packing Dijoins in Digraphs and Weighted Digraphs (Q6057808) (← links)