Subgraph isomorphism in graph classes
Subgraph isomorphism in graph classes is a scholarly work by Toshiki Saitoh, published in 2012 in ''Discrete Mathematics''. The main subjects of the publication include induced subgraph, subgraph isomorphism problem, graph isomorphism, induced subgraph isomorphism problem, split graph, combinatorial optimization, line graph, block graph, graph homomorphism, pathwidth, bipartite graph, factor-critical graph, combinatorics, cograph, Network On Chip, discrete mathematics, distance-hereditary graph, mathematics, and graph theory. The authors investigate the computational complexity of the following restricted variant of Subgraph Isomorphism: given a pair of connected graphs G=(VG,EG) and H=(VH,EH), determine if H is isomorphic to a spanning subgraph of G.