Pages that link to "Item:Q1208447"
From MaRDI portal
The following pages link to Fractional arboricity, strength, and principal partitions in graphs and matroids (Q1208447):
Displaying 40 items.
- Fractional spanning tree packing, forest covering and eigenvalues (Q313822) (← links)
- Cyclic orderings and cyclic arboricity of matroids (Q414636) (← links)
- Spanning cycles in regular matroids without small cocircuits (Q449202) (← links)
- Characterizations of strength extremal graphs (Q489310) (← links)
- Decomposing a graph into pseudoforests with one having bounded degree (Q490985) (← links)
- A proof of the molecular conjecture (Q540449) (← links)
- Balanced and 1-balanced graph constructions (Q608258) (← links)
- Supereulerian graphs in the graph family \(C_{2}(6,k)\) (Q628342) (← links)
- Degree sequences and graphs with disjoint spanning trees (Q642969) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid (Q714036) (← links)
- Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
- Decomposing a graph into forests (Q765188) (← links)
- Brick partitions of graphs (Q960924) (← links)
- Degree conditions for group connectivity (Q966042) (← links)
- Transforming a graph into a 1-balanced graph (Q1003673) (← links)
- Edge-connectivity and edge-disjoint spanning trees (Q1011773) (← links)
- Duality in graph families (Q1208357) (← links)
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness (Q1602687) (← links)
- Extensions of matroid covering and packing (Q1633609) (← links)
- A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs (Q1685990) (← links)
- Decomposing a graph into forests and a matching (Q1748265) (← links)
- Strength and fractional arboricity of complementary graphs (Q1897432) (← links)
- Every matroid is a submatroid of a uniformly dense matroid (Q1902898) (← links)
- Edge-disjoint spanning trees and forests of graphs (Q2028071) (← links)
- Chvátal-Erdős conditions and almost spanning trails (Q2210220) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number (Q2228493) (← links)
- Degree sequence realizations with given packing and covering of spanning trees (Q2341721) (← links)
- Arboricity games: the core and the nucleolus (Q2687037) (← links)
- On \(s\)-Hamiltonian line graphs (Q2862549) (← links)
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering (Q4568066) (← links)
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees (Q5351870) (← links)
- (Q5708565) (← links)
- Digraph analogues for the Nine Dragon Tree Conjecture (Q6046686) (← links)
- Supereulerian regular matroids without small cocircuits (Q6093141) (← links)
- Graph rigidity properties of Ramanujan graphs (Q6133153) (← links)
- Cyclic base ordering of generalized Petersen graphs (Q6551205) (← links)
- Squares of graphs are optimally \((s, t)\)-supereulerian (Q6633548) (← links)
- Cyclic base ordering of certain degenerate graphs (Q6657273) (← links)
