Graph classes: a survey
Enumerating split-pair arrangements
Journal of Combinatorial Theory Series A
Journal of Automata, Languages and Combinatorics
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Graphs capturing alternations in words
DLT'10 Proceedings of the 14th international conference on Developments in language theory
| Hi-index | 0.00 |
A graph G=(V,E) is an alternation graph if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x,y)∈E for each x≠y. In this paper we give an effective characterization of alternation graphs in terms of orientations. Namely, we show that a graph is an alternation graph if and only if it admits a semi-transitive orientation defined in the paper. This allows us to prove a number of results about alternation graphs, in particular showing that the recognition problem is in NP, and that alternation graphs include all 3-colorable graphs. We also explore bounds on the size of the word representation of the graph. A graph G is a k-alternation graph if it is represented by a word in which each letter occurs exactly k times; the alternation number of G is the minimum k for which G is a k-alternation graph. We show that the alternation number is always at most n, while there exist graphs for which it is n/2.