On the connectivity of \(p\)-diamond-free vertex transitive graphs (Q423953): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On unreliability polynomials and graph connectivity in reliable network synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity of diamond-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The superconnectivity of large digraphs and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subsets with small sums in abelian groups. I: The Vosper property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally edge-connected and vertex-connected graphs and digraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity of \(p\)-diamond-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of vertex and edge transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3403686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On super restricted edge-connectivity of edge-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superconnected and hyperconnected small degree transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-connected edge transitive graphs / rank
 
Normal rank

Latest revision as of 07:29, 5 July 2024

scientific article
Language Label Description Also known as
English
On the connectivity of \(p\)-diamond-free vertex transitive graphs
scientific article

    Statements

    On the connectivity of \(p\)-diamond-free vertex transitive graphs (English)
    0 references
    0 references
    0 references
    0 references
    30 May 2012
    0 references
    0 references
    connectivity
    0 references
    superconnected
    0 references
    vertex transitive graphs
    0 references
    diamond-free graphs
    0 references
    \(p\)-diamond-free graphs
    0 references
    0 references