Packing spanning trees in highly essentially connected graphs
type: Item
instance of: scholarly article
title: Packing spanning trees in highly essentially connected graphs
zbMATH Open document ID: 1400.05183
author: Hong-Jian Lai
author: Jiaao Li
published in: Discrete Mathematics
publication date: 2018-11-13T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6976889
zbMATH Keywords: edge-disjoint spanning trees
zbMATH Keywords: essential edge connectivity
zbMATH Keywords: nowhere-zero flows
zbMATH Keywords: circular flow number
zbMATH Keywords: spanning connectivity
zbMATH Keywords: supereulerian width
MaRDI profile type: Publication
full work available at URL: j.disc.2018.09.005
OpenAlex ID: W2895929154
cites work: Claw‐decompositions and tutte‐orientations
cites work: Q5668821
cites work: The spanning subgraphs of eulerian graphs
cites work: Q5422499
cites work: Supereulerian graphs: A survey
cites work: Q4873803
cites work: Edge-connectivity and edge-disjoint spanning trees
cites work: The connectivity of line-graphs
cites work: On spanning disjoint paths in line graphs
cites work: Density of 5/2-critical graphs
cites work: The circular flow number of a 6-edge connected graph is less than four
cites work: Characterising vertex-star transitive and edge-star transitive graphs
cites work: On (k,d)-colorings and fractional nowhere-zero flows
cites work: Advances on the Hamiltonian problem -- a survey
cites work: Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees
cites work: Counterexamples to Jaeger's circular flow conjecture
cites work: Q3274170
cites work: Q3544998
cites work: The spanning connectivity of line graphs
cites work: Q3807237
cites work: An equivalent version of the 3-flow conjecture
cites work: Bounds of the number of disjoint spanning trees
cites work: On circular flows of graphs
cites work: Super edge connectivity properties of connected edge symmetric graphs
cites work: Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
cites work: The flow index and strongly connected orientations
cites work: Nowhere-zero 3-flows and modulo \(k\)-orientations
cites work: Q5181632
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Decomposition of Finite Graphs Into Forests
cites work: The weak 3-flow conjecture and the weak circular flow conjecture
cites work: A Contribution to the Theory of Chromatic Polynomials
cites work: On the Problem of Decomposing a Graph into n Connected Factors
cites work: Star chromatic number
cites work: On restricted edge-connectivity of graphs.
cites work: Degree conditions for group connectivity
cites work: Q3751608
cites work: On hamiltonian line graphs and connectivity
Wikidata QID: Q129122409
DOI: 10.1016/J.DISC.2018.09.005
description: scientific article; zbMATH DE number 6976889