The complexity of the vertex-minor problem (Q2059901): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded vertex-minors for graphs of linear rank-width at most \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of small rank-width are pivot-minors of graphs of small tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions under pivoting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming graph states using single-qubit operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graphs and monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width: algorithmic and structural results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing small pivot-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5635462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank

Revision as of 12:17, 27 July 2024

scientific article
Language Label Description Also known as
English
The complexity of the vertex-minor problem
scientific article

    Statements

    The complexity of the vertex-minor problem (English)
    0 references
    0 references
    0 references
    0 references
    14 December 2021
    0 references
    vertex-minor
    0 references
    computational complexity
    0 references
    circle graphs
    0 references
    NP-complete
    0 references

    Identifiers