Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs (Q411837): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.06.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080110511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. III: Circular interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. V. Global structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3701463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which claw-free graphs are strongly perfect? / rank
 
Normal rank

Latest revision as of 03:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs
scientific article

    Statements

    Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    claw-free graphs
    0 references
    forbidden induced subgraphs
    0 references
    strongly perfect graphs
    0 references
    wireless networking
    0 references
    structural graph theory
    0 references
    0 references