scientific article
From MaRDI portal
Publication:4028103
zbMath0768.68037MaRDI QIDQ4028103
Publication date: 28 March 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (14)
Finding a chain graph in a bipartite permutation graph ⋮ On the complexity of various parameterizations of common induced subgraph isomorphism ⋮ Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs ⋮ Critical properties of bipartite permutation graphs ⋮ Edge contractions in subclasses of chordal graphs ⋮ Subgraph isomorphism in graph classes ⋮ Induced subgraph isomorphism on proper interval and bipartite permutation graphs ⋮ Parameterized complexity of induced graph matching on claw-free graphs ⋮ Edge Contractions in Subclasses of Chordal Graphs ⋮ On retracts, absolute retracts, and foldings in cographs ⋮ When can graph hyperbolicity be computed in linear time? ⋮ Characterizations of cographs as intersection graphs of paths on a grid ⋮ Subgraph isomorphism on graph classes that exclude a substructure ⋮ Containment relations in split graphs
This page was built for publication:
