EVERY N2-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z3-CONNECTED
From MaRDI portal
Publication:3087095
DOI10.1142/S1793830911001140zbMath1222.05136MaRDI QIDQ3087095
Hong-Jian Lai, Ping Li, Ye Chen, Er-ling 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
05C35: Extremal problems in graph theory
05C15: Coloring of graphs and hypergraphs
05C40: Connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- Ore-condition and \(Z_3\)-connectivity
- Nowhere-zero 3-flows in triangularly connected graphs
- 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
- On mod \((2p+1)\)-orientations of graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Nowhere-zero 3-flows of highly connected graphs
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- Group connectivity of 3-edge-connected chordal graphs
- An equivalent version of the 3-flow conjecture
- Ore Condition and Nowhere-Zero 3-Flows
- HamiltonianN2-locally connected claw-free graphs
- Nowhere‐zero 3‐flows in locally connected graphs
- On the algebraic theory of graph colorings
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
- A Contribution to the Theory of Chromatic Polynomials