Pages that link to "Item:Q3910010"
From MaRDI portal
The following pages link to On testing isomorphism of permutation graphs (Q3910010):
Displaying 32 items.
- Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity (Q896861) (← links)
- Finding a maximum independent set in a permutation graph (Q916397) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- Strong tree-cographs are Birkhoff graphs (Q1119942) (← links)
- A note on compact graphs (Q1174181) (← links)
- The isomorphism problem for classes of graphs closed under contraction (Q1175965) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- VF2++ -- an improved subgraph isomorphism algorithm (Q1744243) (← links)
- A vertex ordering characterization of simple-triangle graphs (Q1800397) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
- Isomorphism of chordal (6, 3) graphs (Q1893148) (← links)
- Cleaning interval graphs (Q1939654) (← links)
- The Weisfeiler-Leman dimension of chordal bipartite graphs without bipartite claw (Q2045400) (← links)
- Isomorphism testing for \(T\)-graphs in FPT (Q2154101) (← links)
- Perfect matching cuts partitioning a graph into complementary subgraphs (Q2169960) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- Graphs whose complement and square are isomorphic (Q2449164) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
- Succinct permutation graphs (Q2684486) (← links)
- Simple Geometrical Intersection Graphs (Q5452149) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- Partitioning a graph into complementary subgraphs (Q5918340) (← links)
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs (Q5919325) (← links)
