The \(p\)-restricted edge-connectivity of Kneser graphs (Q2008197): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129086572, #quickstatements; #temporary_batch_1727091163514
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2018.09.072 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2896381901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs from THE BOOK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extraconnectivity of graphs with large minimum degree and girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter-girth sufficient conditions for optimal extraconnectivity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-restricted edge-connectivity of a product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-cuts leaving components of order at least three / rank
 
Normal rank
Property / cites work
 
Property / cites work: The super-connectivity of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian uniform subset graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed version of Menger's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extraconnectivity of graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extraconnectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős–Ko–Rado Theorems: Algebraic Approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number and the 2-rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a kind of reliability analysis of networks / 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: \(k\)-restricted edge-connectivity in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed connectivity of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on 4-restricted edge connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4458210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super edge-connectivity of dense digraphs and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular graphs. A spectral approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(g\)-extra connectivity and diagnosability of crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extra connectivity and extra edge-connectivity of balanced hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129086572 / rank
 
Normal rank

Latest revision as of 13:34, 23 September 2024

scientific article
Language Label Description Also known as
English
The \(p\)-restricted edge-connectivity of Kneser graphs
scientific article

    Statements

    The \(p\)-restricted edge-connectivity of Kneser graphs (English)
    0 references
    22 November 2019
    0 references
    Kneser graphs
    0 references
    restricted edge connectivity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers