Pages that link to "Item:Q3275433"
From MaRDI portal
The following pages link to On the Problem of Decomposing a Graph into <i>n</i> Connected Factors (Q3275433):
Displaying 50 items.
- Antisymmetric flows and edge-connectivity (Q1422419) (← links)
- A linking polynomial of two matroids (Q1433013) (← links)
- Applications of matroid partition to tree decomposition (Q1568255) (← links)
- An algorithm for packing connectors (Q1569028) (← links)
- The connectivity of acyclic orientation graphs (Q1584217) (← links)
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness (Q1602687) (← links)
- Packing spanning trees in highly essentially connected graphs (Q1618210) (← links)
- Extensions of matroid covering and packing (Q1633609) (← links)
- Algorithms for detecting dependencies and rigid subsystems for CAD (Q1634821) (← links)
- Completely independent spanning trees in \(k\)-th power of graphs (Q1649915) (← links)
- A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs (Q1685990) (← links)
- Packing arborescences in random digraphs (Q1689982) (← links)
- Fast approximation of matroid packing and covering (Q1730564) (← links)
- Collapsible subgraphs of a 4-edge-connected graph (Q1741521) (← links)
- Combinatorial rigidity of incidence systems and application to dictionary learning (Q1745767) (← links)
- An enhancement of Nash-Williams' theorem on edge arboricity of graphs (Q1750785) (← links)
- Decomposing highly connected graphs into paths of length five (Q1752489) (← links)
- Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609) (← links)
- Blocking optimal structures (Q1752656) (← links)
- Steiner tree packing number and tree connectivity (Q1752665) (← links)
- Every 3-connected essentially 10-connected line graph is Hamilton-connected (Q1759410) (← links)
- Covering planar graphs with forests (Q1775897) (← links)
- Edge disjoint spanning trees in random graphs (Q1814020) (← links)
- Variations on a game (Q1836601) (← links)
- Connectivity and edge-disjoint spanning trees (Q1837196) (← links)
- Bounds of the number of disjoint spanning trees (Q1844855) (← links)
- Contractible subgraphs in 3-connected graphs (Q1850482) (← links)
- All 4-connected line graphs of claw free graphs are Hamiltonian connected (Q1850549) (← links)
- Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs (Q1861573) (← links)
- A note on biased and non-biased games (Q1894371) (← links)
- Hitting time for \(k\) edge-disjoint spanning trees in a random graph (Q1914720) (← links)
- Disjoint compatible geometric matchings (Q1942309) (← links)
- The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants (Q2007586) (← links)
- Antiparallel \(d\)-stable traces and a stronger version of ore problem (Q2014350) (← links)
- Edge-disjoint spanning trees and forests of graphs (Q2028071) (← links)
- Game edge-connectivity of graphs (Q2028096) (← links)
- Spectral conditions for graph rigidity in the Euclidean plane (Q2043397) (← links)
- Rainbow monochromatic \(k\)-edge-connection colorings of graphs (Q2045397) (← links)
- The region smoothing swap game (Q2046760) (← links)
- Covering projective planar graphs with three forests (Q2075505) (← links)
- Complexity of some arc-partition problems for digraphs (Q2079880) (← links)
- Spanning tree packing and 2-essential edge-connectivity (Q2092353) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- Globally balancing spanning trees (Q2111190) (← links)
- Globally rigid powers of graphs (Q2131861) (← links)
- On the \(s\)-hamiltonianicity of an hourglass-free line graph (Q2142636) (← links)
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees (Q2152797) (← links)
- Strengthened Ore conditions for \((s, t)\)-supereulerian graphs (Q2166214) (← links)
- On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity (Q2197684) (← links)
