EVERY N2-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z3-CONNECTED

DOI10.1142/S1793830911001140MaRDI QIDQ3087095zbMATH OpenOpenAlexFDO

Authors Ye Chen, Ping Li, Hong-Jian Lai, Erling Wei

Publication date 2 August 2011

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830911001140

zbMATH Keywords

claw-free graphsgroup connectivitylocally connectednessnowhere-zero flows

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 932198
• \(Z_3\)-connectivity of claw-free graphs
• Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
• Sufficient condition for Hamiltonicity of \(N_2\)-locally connected claw-free graphs
• Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
• Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs
• Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
• HamiltonianN2-locally connected claw-free graphs
• Every 3-connected distance claw-free graph is Hamilton-connected
• scientific article; zbMATH DE number 1409241

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• An equivalent version of the 3-flow conjecture
• Degree conditions for group connectivity
• Degree sum and nowhere-zero 3-flows
• Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected
• Graph theory with applications
• Group connectivity of 3-edge-connected chordal graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• Hamiltonian circuits in N₂‐locally connected K_1,3‐free graphs
• HamiltonianN2-locally connected claw-free graphs
• scientific article; zbMATH DE number 3286813 (Why is no real title available?)
• Nowhere-zero 3-flows in triangularly connected graphs
• Nowhere-zero 3-flows of highly connected graphs
• Nowhere‐zero 3‐flows in locally connected graphs
• On mod \((2p+1)\)-orientations of graphs
• On the algebraic theory of graph colorings
• Ore Condition and Nowhere-Zero 3-Flows
• Ore-condition and \(Z_3\)-connectivity

Cited in

(1)

• \(Z_3\)-connectivity of claw-free graphs

This page was built for publication: EVERY N₂-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z₃-CONNECTED

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