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.
- On the first-order edge tenacity of a graph (Q266912) (← links)
- Packing Steiner trees (Q273179) (← links)
- A note on edge-disjoint Hamilton cycles in line graphs (Q295256) (← links)
- An inductive construction of minimally rigid body-hinge simple graphs (Q300212) (← links)
- Fast approximation for computing the fractional arboricity and extraction of communities of a graph (Q313816) (← links)
- Fractional spanning tree packing, forest covering and eigenvalues (Q313822) (← links)
- Graphs with large generalized (edge-)connectivity (Q339485) (← links)
- Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree (Q345073) (← links)
- Decomposing highly edge-connected graphs into paths of any given length (Q345101) (← links)
- On 1-Hamilton-connected claw-free graphs (Q394533) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- Packing of rigid spanning subgraphs and spanning trees (Q401490) (← links)
- On spanning tree packings of highly edge connected graphs (Q401495) (← links)
- A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid (Q404444) (← links)
- Edge-decomposition of graphs into copies of a tree with four edges (Q405153) (← links)
- Cycle double covers and the semi-Kotzig frame (Q412256) (← links)
- Hamilton cycles in 5-connected line graphs (Q412285) (← links)
- Cyclic orderings and cyclic arboricity of matroids (Q414636) (← links)
- A short proof of the tree-packing theorem (Q418872) (← links)
- Edge-disjoint spanning trees and eigenvalues of regular graphs (Q426054) (← links)
- Highly connected molecular graphs are rigid in three dimensions (Q436325) (← links)
- Arc-disjoint spanning sub(di)graphs in digraphs (Q441857) (← links)
- Flows and parity subgraphs of graphs with large odd-edge-connectivity (Q444374) (← links)
- Spanning cycles in regular matroids without small cocircuits (Q449202) (← links)
- Decomposing a graph into bistars (Q463290) (← links)
- On the tractability of some natural packing, covering and partitioning problems (Q476298) (← links)
- Characterizations of strength extremal graphs (Q489310) (← links)
- A proof of the molecular conjecture (Q540449) (← links)
- Bounded direction-length frameworks (Q542392) (← links)
- Packing Steiner trees on four terminals (Q602710) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Some inequalities for the Tutte polynomial (Q627930) (← links)
- Circular flow on signed graphs (Q651035) (← links)
- The constructive characterization of \((k,l)\)-edge-connected digraphs (Q653995) (← links)
- Spanning trees: A survey (Q659663) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- Faster algorithms for security games on matroids (Q666676) (← links)
- On the higher-order edge toughness of a graph (Q686452) (← links)
- Submodular functions in graph theory (Q686469) (← links)
- A rooted-forest partition with uniform vertex demand (Q695323) (← links)
- Heuristics for the central tree problem (Q707727) (← links)
- What is on his mind? (Q709300) (← links)
- Locally finite graphs with ends: A topological approach. II: Applications (Q709326) (← links)
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid (Q714036) (← links)
- Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture (Q740648) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- Bidirectional retracting-free double tracings and upper embeddability of graphs (Q751672) (← links)
- Covering weighted graphs by even subgraphs (Q753842) (← links)
- On a packing problem for infinite graphs and independence spaces (Q754225) (← links)
