Subgraph isomorphism in graph classes
DOI10.1016/J.DISC.2012.07.010zbMATH Open1251.05109DBLPjournals/dm/KijimaOSU12OpenAlexW2032950096WikidataQ29031096 ScholiaQ29031096MaRDI QIDQ456655FDOQ456655
Authors: Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno 
Publication date: 16 October 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.07.010
Recommendations
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs
- The complexity of subgraph isomorphism for classes of partial k-trees
- Induced subgraph isomorphism on interval and proper interval graphs
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Classes: A Survey
- Complement reducible graphs
- Efficient graph representations
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear-time certifying recognition algorithms and forbidden induced subgraphs
- Computing the Bandwidth of Interval Graphs
- Finding Hamiltonian circuits in interval graphs
- Hamiltonian circuits in interval graph generalizations
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- The NP-completeness column: an ongoing guide
- Ordered and Unordered Tree Inclusion
- Bandwidth of bipartite permutation graphs in polynomial time
- Planar subgraph isomorphism revisited
- Title not available (Why is that?)
- Subgraph Isomorphism in Planar Graphs and Related Problems
- Random generation and enumeration of bipartite permutation graphs
- A short proof that `proper = unit'
- On testing isomorphism of permutation graphs
- Induced subgraph isomorphism on interval and proper interval graphs
- Bandwidth of Bipartite Permutation Graphs
- The subgraph isomorphism problem for outerplanar graphs
- Cleaning interval graphs
- A structure theorem for the consecutive 1's property
- Title not available (Why is that?)
- The complexity of subgraph isomorphism for classes of partial k-trees
Cited In (21)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The subgraph isomorphism problem on a class of hyperedge replacement languages
- Title not available (Why is that?)
- Finding a chain graph in a bipartite permutation graph
- Algorithmic problems in right-angled Artin groups: complexity and applications
- Notes on integer partitions
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
- Computing and Drawing Isomorphic Subgraphs
- Induced subgraph isomorphism on interval and proper interval graphs
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- Induced subtrees in interval graphs
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- Filtering for Subgraph Isomorphism
- Subgraph isomorphism on graph classes that exclude a substructure
- Subgraph isomorphism on graph classes that exclude a substructure
- Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs
- Title not available (Why is that?)
- A time-based solution for the graph isomorphism problem
- Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes
- Streaming deletion problems Parameterized by vertex cover
This page was built for publication: Subgraph isomorphism in graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456655)
