Nowhere-zero 3-flows and Z₃-connectivity of a family of graphs

DOI10.1016/J.DISC.2011.05.011zbMATH Open1223.05107OpenAlexW1985975947MaRDI QIDQ2275458FDOQ2275458

Authors: Jin Yan 

Publication date: 9 August 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.011

Recommendations

• A note on nowhere-zero 3-flows and \(Z_3\)-connectivity
• Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs
• On group connectivity of graphs
• Nowhere-zero 3-flow of graphs with small independence number
• Nowhere-zero 3-flows and modulo \(k\)-orientations

zbMATH Keywords

nowhere-zero 3-flowdegree condition\(Z_{3}\)-connected

Mathematics Subject Classification ID

Flows in graphs (05C21) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Cites Work

• Graph theory
• Note on Hamilton Circuits
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group connectivity of 3-edge-connected chordal graphs
• Group connectivity of certain graphs
• Ore-condition and \(Z_3\)-connectivity
• Ore Condition and Nowhere-Zero 3-Flows
• Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
• Nowhere-zero 3-flows in triangularly connected graphs
• Degree sum condition for \(Z_{3}\)-connectivity in graphs
• Degree sum and nowhere-zero 3-flows

Cited In (41)

• Ore Condition and Nowhere-Zero 3-Flows
• Flows on the join of two graphs
• Spanning triangle-trees and flows of graphs
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• The complexity of the zero-sum 3-flows
• Join of two graphs admits a nowhere-zero \(3\)-flow.
• Extremal size of graphs without a nowhere-zero 3-flow
• On group connectivity of graphs
• Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows
• Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees
• Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs
• Nowhere-zero 3-flows in toroidal graphs
• Nowhere-zero flows in random graphs
• Nowhere-zero 3-flows in squares of graphs
• \({\mathbb{Z}_3}\)-connectivity of 4-edge-connected triangular graphs
• Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs
• Degree condition and \(Z_3\)-connectivity
• Nowhere-zero 3-flows of claw-free graphs
• Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
• Nowhere-zero 3-flows in triangularly connected graphs
• Nowhere-zero 5-flows and even (1,2)-factors
• Minimum degree and nowhere-zero 3-flows
• Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows
• Pósa-condition and nowhere-zero 3-flows
• Degree sum of 3 independent vertices and \(Z_3\)-connectivity
• Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
• Contractible configurations on 3-flows in graphs satisfying the Fan-condition
• 3-flows with large support
• Degree sum and nowhere-zero 3-flows
• Group connectivity in line graphs
• On 3-flow-critical graphs
• On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs
• Additive bases and flows in graphs
• \(Z_3\)-connectivity of claw-free graphs
• Nowhere-zero 3-flow of graphs with small independence number
• All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected
• Nowhere-zero 3-flows of graphs with independence number two
• Flow extensions and group connectivity with applications
• Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts
• A note on nowhere-zero 3-flows and \(Z_3\)-connectivity
• Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows

This page was built for publication: Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275458)