Packing spanning trees in highly essentially connected graphs
From MaRDI portal
Publication:1618210
DOI10.1016/j.disc.2018.09.005zbMath1400.05183OpenAlexW2895929154WikidataQ129122409 ScholiaQ129122409MaRDI QIDQ1618210
Publication date: 13 November 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.09.005
nowhere-zero flowsedge-disjoint spanning treesspanning connectivityessential edge connectivitycircular flow numbersupereulerian width
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items
Spectral radius and edge‐disjoint spanning trees ⋮ Completely independent spanning trees in line graphs ⋮ Spanning tree packing and 2-essential edge-connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The weak 3-flow conjecture and the weak circular flow conjecture
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- The spanning connectivity of line graphs
- On hamiltonian line graphs and connectivity
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
- Degree conditions for group connectivity
- Edge-connectivity and edge-disjoint spanning trees
- Advances on the Hamiltonian problem -- a survey
- Density of 5/2-critical graphs
- The flow index and strongly connected orientations
- Counterexamples to Jaeger's circular flow conjecture
- Bounds of the number of disjoint spanning trees
- An equivalent version of the 3-flow conjecture
- The circular flow number of a 6-edge connected graph is less than four
- Characterising vertex-star transitive and edge-star transitive graphs
- On circular flows of graphs
- The connectivity of line-graphs
- On spanning disjoint paths in line graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Star chromatic number
- Supereulerian graphs: A survey
- The spanning subgraphs of eulerian graphs
- Super edge connectivity properties of connected edge symmetric graphs
- On (k,d)-colorings and fractional nowhere-zero flows
- Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees
- Claw‐decompositions and tutte‐orientations
- Decomposition of Finite Graphs Into Forests
- A Contribution to the Theory of Chromatic Polynomials
- On restricted edge-connectivity of graphs.
This page was built for publication: Packing spanning trees in highly essentially connected graphs
