A generalization of an independent set with application to \((K_q; k)\)-stable graphs (Q741777): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the size of \((H;1)\)-vertex stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \((C_n;k)\) stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (H,k) stable graphs with minimum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex stability with regard to complete bipartite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (H,k) stable bipartite graphs with the minimum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \((K_q,k)\) vertex stable graphs with minimum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \((K_{q},k)\) stable graphs with small \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal \(k\)-edge-Hamiltonian hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal \(P_4\)-stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (Kq;k)-Stable Graphs / rank
 
Normal rank

Revision as of 00:47, 9 July 2024

scientific article
Language Label Description Also known as
English
A generalization of an independent set with application to \((K_q; k)\)-stable graphs
scientific article

    Statements

    A generalization of an independent set with application to \((K_q; k)\)-stable graphs (English)
    0 references
    12 September 2014
    0 references
    independent set
    0 references
    independence number
    0 references
    clique
    0 references
    0 references

    Identifiers