Pages that link to "Item:Q3904620"
From MaRDI portal
The following pages link to Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs (Q3904620):
Displaying 28 items.
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- Minimal obstructions for partial representations of interval graphs (Q668026) (← links)
- Counting graceful labelings of trees: a theoretical and empirical study (Q897585) (← links)
- Determining sets, resolving sets, and the exchange property (Q968219) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- Lexicographically least circular substrings (Q1144948) (← links)
- On uniform circuit complexity (Q1152951) (← links)
- Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
- Fast detection and display of symmetry in outerplanar graphs (Q1199463) (← links)
- A selected tour of the theory of identification matrices (Q1575436) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- 3-connected reduction for regular graph covers (Q1663806) (← links)
- Cleaning interval graphs (Q1939654) (← links)
- Graph isomorphism and identification matrices: Sequential algorithms (Q1970201) (← links)
- Measuring tree balance using symmetry nodes -- a new balance index and its extremal properties (Q2066458) (← links)
- Isomorphism testing for \(T\)-graphs in FPT (Q2154101) (← links)
- Relations and bounds for the zeros of graph polynomials using vertex orbits (Q2180690) (← links)
- Practical graph isomorphism. II. (Q2437295) (← links)
- Plane graphs with parity constraints (Q2441354) (← links)
- Minimal Obstructions for Partial Representations of Interval Graphs (Q2942647) (← links)
- Plane Graphs with Parity Constraints (Q3183437) (← links)
- Farey Series and Maximal Outerplanar Graphs (Q3964591) (← links)
- A fast average case algorithm for lyndon decomposition (Q4876360) (← links)
- Canonical representations of partial 2-and 3-trees (Q5056113) (← links)
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs (Q5919325) (← links)
- Relationships between symmetry-based graph measures (Q6139463) (← links)
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
- Minimal representatives of endofunctions (Q6651825) (← links)
