There exist highly critically connected graphs of diameter three (Q882783): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endlichkeitssätze für k-kritische Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-con-critically \(n\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-critical, n-connected graphs / rank
 
Normal rank

Latest revision as of 19:58, 25 June 2024

scientific article
Language Label Description Also known as
English
There exist highly critically connected graphs of diameter three
scientific article

    Statements

    There exist highly critically connected graphs of diameter three (English)
    0 references
    0 references
    24 May 2007
    0 references
    Critical connectivity
    0 references

    Identifiers