Subgraph isomorphism in graph classes (Q456655): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hamiltonian circuits in interval graph generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof that `proper = unit' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On testing isomorphism of permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Subgraph Isomorphism Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph Isomorphism in Planar Graphs and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of subgraph isomorphism for classes of partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of bipartite permutation graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Subgraph Isomorphism on Interval and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: an ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian circuits in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered and Unordered Tree Inclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Bandwidth of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3731030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cleaning interval 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: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation and enumeration of bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subgraph isomorphism problem for outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure theorem for the consecutive 1's property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of Bipartite Permutation Graphs / rank
 
Normal rank

Latest revision as of 19:12, 5 July 2024

scientific article
Language Label Description Also known as
English
Subgraph isomorphism in graph classes
scientific article

    Statements

    Subgraph isomorphism in graph classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    subgraph isomorphism
    0 references
    graph class
    0 references
    NP-completeness
    0 references
    graph algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references