The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs (Q1959708): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Vertices of degree 5 in a contraction critically 5-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizaions of critical connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncontractable 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of contraction-critical 5-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonseparating cycles inK-Connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3284374 / rank
 
Normal rank

Revision as of 06:53, 3 July 2024

scientific article
Language Label Description Also known as
English
The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references