Packing spanning trees in highly essentially connected graphs
From MaRDI portal
(Redirected from Publication:1618210)
Recommendations
- Spanning tree packing and 2-essential edge-connectivity
- On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
- Spanning trees and spanning Eulerian subgraphs with small degrees
- Packing of rigid spanning subgraphs and spanning trees
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- Advances on the Hamiltonian problem -- a survey
- An equivalent version of the 3-flow conjecture
- Bounds of the number of disjoint spanning trees
- Characterising vertex-star transitive and edge-star transitive graphs
- Claw‐decompositions and tutte‐orientations
- Counterexamples to Jaeger's circular flow conjecture
- Decomposition of Finite Graphs Into Forests
- Degree conditions for group connectivity
- Density of 5/2-critical graphs
- Edge-connectivity and edge-disjoint spanning trees
- Edge-Disjoint Spanning Trees of Finite Graphs
- Graph theory
- Graph theory and interconnection networks.
- scientific article; zbMATH DE number 3156381 (Why is no real title available?)
- scientific article; zbMATH DE number 3987316 (Why is no real title available?)
- scientific article; zbMATH DE number 4075098 (Why is no real title available?)
- scientific article; zbMATH DE number 867689 (Why is no real title available?)
- scientific article; zbMATH DE number 3428857 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees
- On (k,d)-colorings and fractional nowhere-zero flows
- On circular flows of graphs
- On hamiltonian line graphs and connectivity
- On restricted edge-connectivity of graphs.
- On spanning disjoint paths in line graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Star chromatic number
- Super edge connectivity properties of connected edge symmetric graphs
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
- Supereulerian graphs: A survey
- The circular flow number of a 6-edge connected graph is less than four
- The connectivity of line-graphs
- The flow index and strongly connected orientations
- The spanning connectivity of line graphs
- The spanning subgraphs of eulerian graphs
- The weak 3-flow conjecture and the weak circular flow conjecture
Cited in
(10)- Spanning tree packing and 2-essential edge-connectivity
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
- Packing of rigid spanning subgraphs and spanning trees
- On spanning tree packings of highly edge connected graphs
- Edge connectivity, packing spanning trees, and eigenvalues of graphs
- Spectral radius and edge‐disjoint spanning trees
- Completely independent spanning trees in line graphs
- Extremal spectral radius and essential edge-connectivity
- Eigenvalue conditions implying edge-disjoint spanning trees and a forest with constraints
- Spectral radius and edge-disjoint spanning trees of graphs with prescribed edge connectivity
This page was built for publication: Packing spanning trees in highly essentially connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1618210)
