58,621 research outputs found

    Representing Graphs via Pattern Avoiding Words

    Get PDF
    The notion of a word-representable graph has been studied in a series of papers in the literature. A graph G=(V,E)G=(V,E) is word-representable if there exists a word ww over the alphabet VV such that letters xx and yy alternate in ww if and only if xyxy is an edge in EE. If V={1,…,n}V =\{1, \ldots, n\}, this is equivalent to saying that GG is word-representable if for all x,y∈{1,…,n}x,y \in \{1, \ldots, n\}, xy∈Exy \in E if and only if the subword w{x,y}w_{\{x,y\}} of ww consisting of all occurrences of xx or yy in ww has no consecutive occurrence of the pattern 11. In this paper, we introduce the study of uu-representable graphs for any word u∈{1,2}∗u \in \{1,2\}^*. A graph GG is uu-representable if and only if there is a labeled version of GG, G=({1,…,n},E)G=(\{1, \ldots, n\}, E), and a word w∈{1,…,n}∗w \in \{1, \ldots, n\}^* such that for all x,y∈{1,…,n}x,y \in \{1, \ldots, n\}, xy∈Exy \in E if and only if w{x,y}w_{\{x,y\}} has no consecutive occurrence of the pattern uu. Thus, word-representable graphs are just 1111-representable graphs. We show that for any k≥3k \geq 3, every finite graph GG is 1k1^k-representable. This contrasts with the fact that not all graphs are 11-representable graphs. The main focus of the paper is the study of 1212-representable graphs. In particular, we classify the 1212-representable trees. We show that any 1212-representable graph is a comparability graph and the class of 1212-representable graphs include the classes of co-interval graphs and permutation graphs. We also state a number of facts on 1212-representation of induced subgraphs of a grid graph

    On the 12-representability of induced subgraphs of a grid graph

    Get PDF
    The notion of a 12-representable graph was introduced by Jones, Kitaev, Pyatkin and Remmel in [Representing graphs via pattern avoiding words, Electron. J. Combin. 22 (2015) #P2.53]. This notion generalizes the notions of the much studied permutation graphs and co-interval graphs. It is known that any 12-representable graph is a comparability graph, and also that a tree is 12-representable if and only if it is a double caterpillar. Moreover, Jones et al. initiated the study of 12- representability of induced subgraphs of a grid graph, and asked whether it is possible to characterize such graphs. This question of Jones et al. is meant to be about induced subgraphs of a grid graph that consist of squares, which we call square grid graphs. However, an induced subgraph in a grid graph does not have to contain entire squares, and we call such graphs line grid graphs. In this paper we answer the question of Jones et al. by providing a complete characterization of 12-representable square grid graphs in terms of forbidden induced subgraphs. Moreover, we conjecture such a characterization for the line grid graphs and give a number of results towards solving this challenging conjecture. Our results are a major step in the direction of characterization of all 12-representable graphs since beyond our characterization, we also discuss relations between graph labelings and 12-representability, one of the key open questions in the area

    Graph classes and forbidden patterns on three vertices

    Full text link
    This paper deals with graph classes characterization and recognition. A popular way to characterize a graph class is to list a minimal set of forbidden induced subgraphs. Unfortunately this strategy usually does not lead to an efficient recognition algorithm. On the other hand, many graph classes can be efficiently recognized by techniques based on some interesting orderings of the nodes, such as the ones given by traversals. We study specifically graph classes that have an ordering avoiding some ordered structures. More precisely, we consider what we call patterns on three nodes, and the recognition complexity of the associated classes. In this domain, there are two key previous works. Damashke started the study of the classes defined by forbidden patterns, a set that contains interval, chordal and bipartite graphs among others. On the algorithmic side, Hell, Mohar and Rafiey proved that any class defined by a set of forbidden patterns can be recognized in polynomial time. We improve on these two works, by characterizing systematically all the classes defined sets of forbidden patterns (on three nodes), and proving that among the 23 different classes (up to complementation) that we find, 21 can actually be recognized in linear time. Beyond this result, we consider that this type of characterization is very useful, leads to a rich structure of classes, and generates a lot of open questions worth investigating.Comment: Third version version. 38 page

    A Note on Flips in Diagonal Rectangulations

    Get PDF
    Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal with local changes involving a single edge of a rectangulation, referred to as flips, edge rotations, or edge pivoting. Such operations induce a graph on equivalence classes of rectangulations, related to so-called flip graphs on triangulations and other families of geometric partitions. In this note, we consider a family of flip operations on the equivalence classes of diagonal rectangulations, and their interpretation as transpositions in the associated Baxter permutations, avoiding the vincular patterns { 3{14}2, 2{41}3 }. This complements results from Law and Reading (JCTA, 2012) and provides a complete characterization of flip operations on diagonal rectangulations, in both geometric and combinatorial terms
    • …
    corecore