Flows and parity subgraphs of graphs with large odd-edge-connectivity
From MaRDI portal
Publication:444374
DOI10.1016/j.jctb.2012.03.002zbMath1244.05108MaRDI QIDQ444374
Cun-Quan Zhang, Taoye Zhang, Jin-Long Shu
Publication date: 14 August 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2012.03.002
Related Items
Cites Work
- Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
- Flows and generalized coloring theorems in graphs
- Nowhere-zero 6-flows
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Duality in graph families
- Nowhere-zero 3-flows of highly connected graphs
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
- Group connectivity of 3-edge-connected chordal graphs
- An equivalent version of the 3-flow conjecture
- The circular flow number of a 6-edge connected graph is less than four
- On circular flows of graphs
- Circular flows of nearly Eulerian graphs and vertex-splitting
- Double cycle covers and the petersen graph
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- A Reduction Method for Edge-Connectivity in Graphs
- Construction of graphs with given circular flow numbers
- Clustering, community partition and disjoint spanning trees
- Coloring-flow duality of embedded graphs
- Claw‐decompositions and tutte‐orientations
- Polyhedral decompositions of cubic graphs
- On the Imbedding of Linear Graphs in Surfaces
- A Contribution to the Theory of Chromatic Polynomials
- Circular chromatic number: A survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
