The following pages link to (Q3875946):
Displayed 20 items.
- The topological drawing of a graph: construction methods (Q386927) (← links)
- Linear time tree codes (Q799118) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Isomorphic factorizations VIII: Bisectable trees (Q1060225) (← links)
- A sequence representation for maps (Q1154473) (← links)
- Testing planar pictures for isomorphism in linear time (Q1175964) (← links)
- The isomorphism problem for classes of graphs closed under contraction (Q1175965) (← links)
- A remark on the time complexity of the subtree problem (Q1249180) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Construction of a topological drawing of the most planar subgraph of the non-planar graph (Q1792535) (← links)
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time (Q1823708) (← links)
- Isomorphism of chordal (6, 3) graphs (Q1893148) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- On digraphs with a rooted tree structure (Q3705478) (← links)
- Isomorphism Testing in Hookup Classes (Q3968949) (← links)
- A new algorithm for digraph isomorphism (Q4136562) (← links)
- (Q4154737) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)