Pages that link to "Item:Q1410689"

The following pages link to On decomposing a hypergraph into \(k\) connected sub-hypergraphs (Q1410689):

Displaying 34 items.

• Packing Steiner trees (Q273179) (← links)
• Hamilton cycles in 5-connected line graphs (Q412285) (← links)
• Spanning trees: A survey (Q659663) (← links)
• Packing of Steiner trees and \(S\)-connectors in graphs (Q765198) (← links)
• Connectivity spaces (Q904527) (← links)
• Sparse hypergraphs and pebble game algorithms (Q1041613) (← links)
• Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs (Q1410701) (← links)
• Connectivity calculus (Q1431949) (← links)
• Applications of matroid partition to tree decomposition (Q1568255) (← links)
• A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs (Q1685990) (← links)
• Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
• Steiner tree packing number and tree connectivity (Q1752665) (← links)
• Computing minimum multiway cuts in hypergraphs (Q1799394) (← links)
• Packing of mixed hyperarborescences with flexible roots via matroid intersection (Q2048562) (← links)
• On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
• Reachability in arborescence packings (Q2166224) (← links)
• The \(\kappa_k\)-connectivity of line graphs (Q2197398) (← links)
• Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
• Packing Steiner trees with identical terminal sets (Q2390272) (← links)
• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
• Edge-partitioning 3-edge-connected graphs into paths (Q2673486) (← links)
• Edge-disjoint Steiner trees and connectors in graphs (Q2701394) (← links)
• Local spanning trees in graphs and hypergraphs decomposition with respect to edge connectivity (Q2741349) (← links)
• Hamilton cycles in 6-connected claw-free graphs (extended abstract) (Q2851482) (← links)
• A Survey on Covering Supermodular Functions (Q2971606) (← links)
• Packing the Steiner trees of a graph (Q3057108) (← links)
• (Q3137219) (← links)
• Edge disjoint Steiner trees in graphs without large bridges (Q3652550) (← links)
• Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
• On derivable trees (Q5135728) (← links)
• Decomposing hypercubes into regular connected subgraphs (Q5298350) (← links)
• Steiner connectivity problems in hypergraphs (Q6072212) (← links)
• On hamiltonian line graphs of hypergraphs (Q6081552) (← links)
• Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)