On a lower bound for the connectivity of the independence complex of a graph (Q409373): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2011.06.010 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q5848908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent systems of representatives in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence complexes of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination numbers and homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of group theoretic problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2011.06.010 / rank
 
Normal rank

Latest revision as of 17:43, 9 December 2024

scientific article
Language Label Description Also known as
English
On a lower bound for the connectivity of the independence complex of a graph
scientific article

    Statements

    On a lower bound for the connectivity of the independence complex of a graph (English)
    0 references
    0 references
    0 references
    13 April 2012
    0 references
    independence complex
    0 references
    topological connectivity
    0 references

    Identifiers

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