Degree sum and nowhere-zero 3-flows
From MaRDI portal
Publication:998360
DOI10.1016/J.DISC.2007.11.045zbMATH Open1167.05309OpenAlexW2031824194MaRDI QIDQ998360FDOQ998360
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.045
Recommendations
Cites Work
- Title not available (Why is that?)
- A Contribution to the Theory of Chromatic Polynomials
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity of 3-edge-connected chordal graphs
- Nowhere-zero 6-flows
- Nowhere‐zero 3‐flows in locally connected graphs
- Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
- Nowhere-zero 3-flows in triangularly connected graphs
- Group connectivity of graphs with diameter at most 2
- Nowhere-zero flows in tensor product of graphs
Cited In (24)
- \(Z_3\)-connectivity of wreath product of graphs
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- The complexity of the zero-sum 3-flows
- The Chvátal-Erdős condition for group connectivity in graphs
- Extremal size of graphs without a nowhere-zero 3-flow
- Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows
- EVERY N2-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z3-CONNECTED
- Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs
- Nowhere-zero 3-flows in nilpotently vertex-transitive graphs
- Degree condition and \(Z_3\)-connectivity
- Ore-condition and \(Z_3\)-connectivity
- A note on \(Z_3\)-connected graphs with degree sum condition
- Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs
- Nowhere-zero 3-flows of claw-free graphs
- Pósa-condition and nowhere-zero 3-flows
- On dense strongly \(\mathbb{Z}_{2 s + 1}\)-connected graphs
- Degree sum of a pair of independent edges and \(Z_{3}\)-connectivity
- Degree sum of 3 independent vertices and \(Z_3\)-connectivity
- An equivalent version of the 3-flow conjecture
- Degree sum condition for \(Z_{3}\)-connectivity in graphs
- Group connectivity and group colorings of graphs --- a survey
- Neighborhood unions and \(Z_3\)-connectivity in graphs
- Nowhere-zero 3-flows of graphs with independence number two
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
This page was built for publication: Degree sum and nowhere-zero 3-flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998360)