Alternation graphs

DOI10.1007/978-3-642-25870-1_18zbMATH Open1341.05243OpenAlexW2911323838MaRDI QIDQ3104776FDOQ3104776

Authors: Magnús M. Halldórsson, Sergey Kitaev, Artem 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

Recommendations

• Semi-transitive orientations and word-representable graphs
• A comprehensive introduction to the theory of word-representable graphs
• Word-representability of split graphs
• Word-Representable Graphs: a Survey
• On representable graphs

zbMATH Keywords

alternation numberword representation of a graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Cites Work

• Graph Classes: A Survey
• The Complexity of the Partial Order Dimension Problem
• Title not available (Why is that?)
• Graphs Capturing Alternations in Words
• On representable graphs
• Word problem of the Perkins semigroup via directed acyclic graphs.
• The Hardness of Approximating Poset Dimension
• Circle graphs and monadic second-order logic
• A study of the cyclic scheduling problem on parallel processors
• On scheduling cycle shops: Classification, complexity and approximation
• Enumerating split-pair arrangements
• Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
• Graph Drawing

Cited In (17)

• Alternating graphs
• On strict (outer-)confluent graphs
• On strict (outer-)confluent graphs
• Word-representability of graphs with respect to split recomposition
• Word-representability of triangulations of grid-covered cylinder graphs
• New results on word-representable graphs
• Word-representability of face subdivisions of triangular grid graphs
• Minimum length word-representants of word-representable graphs
• On operations preserving semi-transitive orientability of graphs
• Word-Representable Graphs: a Survey
• Word-representable graphs from a word's perspective
• On word-representability of polyomino triangulations
• Semi-transitive orientations and word-representable graphs
• Representing graphs via pattern avoiding words
• On semi-transitive orientability of Kneser graphs and their complements
• On word-representable and multi-word-representable graphs
• Solving computational problems in the theory of word-representable graphs

This page was built for publication: Alternation graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104776)