Z₃-connectivity of claw-free graphs

DOI10.1007/S00373-016-1754-3MaRDI QIDQ2361081zbMATH OpenOpenAlexFDO

Authors Ziwen Huang, Xiangwen Li, Jianqing Ma

Publication date 29 June 2017

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-016-1754-3

zbMATH Keywords

\(Z_3\)-connectivityclaw-free graphneighborhood intersectionnowhere-zero \(k\)-flow

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• \(Z_3\)-connectivity of \(K_{1,3}\)-free graphs without induced cycle of length at least 5
• Nowhere-zero 3-flows and Z₃-connectivity of graphs without two forbidden subgraphs
• Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs
• Group connectivity in line graphs
• EVERY N₂-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z₃-CONNECTED

Cites work

• 2‐neighborhoods and hamiltonian conditions
• (2p+1)-orientations in line graphs
• A Contribution to the Theory of Chromatic Polynomials
• An equivalent version of the 3-flow conjecture
• Degree condition and \(Z_3\)-connectivity
• Degree sum condition for \(Z_{3}\)-connectivity in graphs
• Degree sum of 3 independent vertices and \(Z_3\)-connectivity
• Graph theory
• Group connectivity and group colorings of graphs --- a survey
• 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
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere-zero 3-flows in triangularly connected graphs
• 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 Imbedding of Linear Graphs in Surfaces
• Ore Condition and Nowhere-Zero 3-Flows
• Ore-condition and \(Z_3\)-connectivity
• The weak 3-flow conjecture and the weak circular flow conjecture

Cited in

(11)

• A characterization of some graphs which do not contain 3-claws
• The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
• \(Z_3\)-connectivity of \(K_{1,3}\)-free graphs without induced cycle of length at least 5
• A twelve vertex theorem for 3-connected claw-free graphs
• Nowhere-zero 3-flows and Z₃-connectivity of graphs without two forbidden subgraphs
• EVERY N₂-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z₃-CONNECTED
• \(Z_3\)-connectivity in abelian Cayley graphs
• Group connectivity in line graphs
• \(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs
• On 3-stable number conditions in \(n\)-connected claw-free graphs
• Nowhere-zero 3-flows of claw-free graphs

This page was built for publication: \(Z_3\)-connectivity of claw-free graphs

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