Alternation Graphs
From MaRDI portal
Publication:3104776
DOI10.1007/978-3-642-25870-1_18zbMath1341.05243OpenAlexW2911323838MaRDI QIDQ3104776
Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin
Publication date: 16 December 2011
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25870-1_18
Related Items (14)
Word-representability of triangulations of grid-covered cylinder graphs ⋮ Word-Representable Graphs: a Survey ⋮ Word-representability of face subdivisions of triangular grid graphs ⋮ New results on word-representable graphs ⋮ On Strict (Outer-)Confluent Graphs ⋮ On semi-transitive orientability of Kneser graphs and their complements ⋮ On word-representable and multi-word-representable graphs ⋮ On word-representability of polyomino triangulations ⋮ On operations preserving semi-transitive orientability of graphs ⋮ Minimum length word-representants of word-representable graphs ⋮ Semi-transitive orientations and word-representable graphs ⋮ On strict (outer-)confluent graphs ⋮ Solving computational problems in the theory of word-representable graphs ⋮ Representing graphs via pattern avoiding words
Cites Work
- Unnamed Item
- Circle graphs and monadic second-order logic
- Word problem of the Perkins semigroup via directed acyclic graphs.
- A study of the cyclic scheduling problem on parallel processors
- On scheduling cycle shops: Classification, complexity and approximation
- Enumerating split-pair arrangements
- The Hardness of Approximating Poset Dimension
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
- Graphs Capturing Alternations in Words
- The Complexity of the Partial Order Dimension Problem
- Graph Classes: A Survey
- Graph Drawing
- On representable graphs
This page was built for publication: Alternation Graphs
