Some problems on induced subgraphs (Q1693168): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Bisimplicial vertices in even-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K_{4}\)-free graphs with no odd holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems / 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: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the divisibility of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded clique cover of some sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs of graphs with large chromatic number. I. Odd holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large holes / rank
 
Normal rank

Revision as of 22:10, 14 July 2024

scientific article
Language Label Description Also known as
English
Some problems on induced subgraphs
scientific article

    Statements

    Some problems on induced subgraphs (English)
    0 references
    0 references
    11 January 2018
    0 references
    induced subgraph
    0 references
    chromatic number
    0 references
    clique number
    0 references
    forbidden induced subgraph
    0 references
    NP-completeness
    0 references
    perfect graph
    0 references

    Identifiers