Nowhere-zero 3-flows and Z₃-connectivity of graphs without two forbidden subgraphs

DOI10.1016/J.DISC.2016.03.010MaRDI QIDQ297939zbMATH OpenOpenAlexFDO

Authors Xiangwen Li, Yuanyuan Liu

Publication date 20 June 2016

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\(K_{1, 3}\)-free graph\(Z_3\)-connectivitynowhere-zero 3-flow

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs
• \(Z_3\)-connectivity of claw-free graphs
• \(Z_3\)-connectivity of \(K_{1,3}\)-free graphs without induced cycle of length at least 5
• Nowhere-zero 3-flows of claw-free graphs
• scientific article; zbMATH DE number 2187683

Cites work

• scientific article; zbMATH DE number 3435527 (Why is no real title available?)
• An equivalent version of the 3-flow conjecture
• Characterizing forbidden pairs for hamiltonian properties
• Contractible configurations on 3-flows in graphs satisfying the Fan-condition
• Degree condition and \(Z_3\)-connectivity
• Forbidden subgraphs and Hamiltonian properties and graphs
• Group connectivity of 3-edge-connected chordal graphs
• Group connectivity of certain graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Neighborhood unions and \(Z_3\)-connectivity in graphs
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere-zero 3-flows of claw-free graphs
• Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
• Nowhere‐zero 3‐flows in locally connected graphs
• On the algebraic theory of graph colorings
• Ore Condition and Nowhere-Zero 3-Flows
• Ore-condition and \(Z_3\)-connectivity
• Pósa-condition and nowhere-zero 3-flows
• The weak 3-flow conjecture and the weak circular flow conjecture

Cited in

(11)

• \(Z_3\)-connectivity of \(K_{1,3}\)-free graphs without induced cycle of length at least 5
• 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 of claw-free graphs
• Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
• Nowhere-zero 3-flows in triangularly connected graphs
• \(Z_3\)-connectivity of claw-free graphs
• Nowhere-zero 3-flow of graphs with small independence number
• scientific article; zbMATH DE number 2187683 (Why is no real title available?)
• All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected
• Nowhere-zero 3-flows of graphs with independence number two

This page was built for publication: Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs

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