On the forbidden induced subgraph probe and sandwich problems (Q1686049): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Luérbio Faria / rank
Normal rank
 
Property / author
 
Property / author: Luérbio Faria / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: IMP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.04.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2359831704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Models of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the forbidden induced subgraph sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sandwich Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:54, 14 July 2024

scientific article
Language Label Description Also known as
English
On the forbidden induced subgraph probe and sandwich problems
scientific article

    Statements

    On the forbidden induced subgraph probe and sandwich problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 December 2017
    0 references
    probe graphs
    0 references
    graph sandwich problems
    0 references
    \(F\)-free graphs
    0 references
    \(C_k\)-free graphs
    0 references
    \((C_4, \ldots, C_{|N|})\)-free graphs
    0 references

    Identifiers