Minimal obstructions to 2-polar cographs (Q2414467): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs and well‐quasi‐ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polar cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to ``Polar cographs'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitions with prescribed patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for recognizing polar and monopolar graphs / rank
 
Normal rank

Latest revision as of 07:43, 19 July 2024

scientific article
Language Label Description Also known as
English
Minimal obstructions to 2-polar cographs
scientific article

    Statements

    Minimal obstructions to 2-polar cographs (English)
    0 references
    0 references
    0 references
    17 May 2019
    0 references
    0 references
    polar graph
    0 references
    cograph
    0 references
    forbidden subgraph characterization
    0 references
    \(k\)-polar graph
    0 references
    matrix partition
    0 references
    generalized coloring
    0 references
    0 references
    0 references