EVERY N<sub>2</sub>-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z<sub>3</sub>-CONNECTED (Q3087095): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q2115226
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Er-ling Wei / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5570136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 3-flows in triangularly connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore Condition and Nowhere-Zero 3-Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sum and nowhere-zero 3-flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An equivalent version of the 3-flow conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group connectivity of 3-edge-connected chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere‐zero 3‐flows in locally connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mod \((2p+1)\)-orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: HamiltonianN2-locally connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 3-flows of highly connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-condition and \(Z_3\)-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in <i>N</i><sub>2</sub>‐locally connected <i>K</i><sub>1,3</sub>‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic theory of graph colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for group connectivity / rank
 
Normal rank

Revision as of 09:28, 4 July 2024

scientific article
Language Label Description Also known as
English
EVERY N<sub>2</sub>-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z<sub>3</sub>-CONNECTED
scientific article

    Statements

    EVERY N<sub>2</sub>-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z<sub>3</sub>-CONNECTED (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    group connectivity
    0 references
    nowhere-zero flows
    0 references
    locally connectedness
    0 references
    claw-free graphs
    0 references