Subgraph isomorphism in graph classes
type: Item
instance of: scholarly article
title: Subgraph isomorphism in graph classes
zbMATH Open document ID: 1251.05109
author: Shuji Kijima
author: Yota Otachi
author: Toshiki Saitoh
author: Takeaki Uno
published in: Discrete Mathematics
publication date: 2012-10-16T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6093929
zbMATH Keywords: subgraph isomorphism
zbMATH Keywords: graph class
zbMATH Keywords: NP-completeness
zbMATH Keywords: graph algorithm
MaRDI profile type: Publication
Wikidata QID: Q29031096
full work available at URL: j.disc.2012.07.010
OpenAlex ID: W2032950096
cites work: Hamiltonian circuits in interval graph generalizations
cites work: A short proof that `proper = unit'
cites work: Q3694712
cites work: Graph Classes: A Survey
cites work: On testing isomorphism of permutation graphs
cites work: Complement reducible graphs
cites work: Q4028103
cites work: Planar Subgraph Isomorphism Revisited
cites work: Subgraph Isomorphism in Planar Graphs and Related Problems
cites work: Q4198056
cites work: Q3328583
cites work: The complexity of subgraph isomorphism for classes of partial k-trees
cites work: Q5503435
cites work: Bandwidth of bipartite permutation graphs in polynomial time
cites work: Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
cites work: The NP-completeness column: an ongoing guide
cites work: Finding Hamiltonian circuits in interval graphs
cites work: Ordered and Unordered Tree Inclusion
cites work: Computing the Bandwidth of Interval Graphs
cites work: Q3731030
cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism
cites work: Cleaning interval graphs
cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees
cites work: Q5588432
cites work: Random generation and enumeration of bipartite permutation graphs
cites work: Efficient graph representations
cites work: The subgraph isomorphism problem for outerplanar graphs
cites work: A structure theorem for the consecutive 1's property
cites work: Bandwidth of Bipartite Permutation Graphs
DBLP publication ID: journals/dm/KijimaOSU12
DOI: 10.1016/J.DISC.2012.07.010
description: scientific article; zbMATH DE number 6093929