论文信息 - Letter graphs and geometric grid classes of permutations: Characterization and recognition

Letter graphs and geometric grid classes of permutations: Characterization and recognition

In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. We also present the first constructive polynomial-time algorithm for the recognition of 3-letter graphs.

Vadim V. Lozin | D. de Werra | Viktor Zamaraev | Bogdan Alecu

[1] Mike D. Atkinson,et al. Restricted permutations , 1999, Discret. Math..

[2] Jaroslav Nesetril. on ordered Graphs and Graph orderings , 1994, Discret. Appl. Math..

[3] Vadim V. Lozin,et al. Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition , 2017, IWOCA.

[4] Marko Petkovsek,et al. Letter graphs and well-quasi-order by induced subgraphs , 2002, Discret. Math..

[5] P. Hammer,et al. Aggregation of inequalities in integer programming. , 1975 .

[6] M. Atkinson,et al. Geometric grid classes of permutations , 2011, 1108.6319.

[7] Peter Damaschke,et al. Induced subgraphs and well-quasi-ordering , 1990, J. Graph Theory.

[8] Alexander K. Kelmans,et al. On Universal Threshold Graphs , 1994, Combinatorics, Probability and Computing.

[9] Vadim V. Lozin,et al. Two forbidden induced subgraphs and well-quasi-ordering , 2011, Discret. Math..

[10] Michael Lampis,et al. Algorithmic Meta-theorems for Restrictions of Treewidth , 2010, Algorithmica.

[11] Vadim V. Lozin,et al. Labelled Induced Subgraphs and Well-Quasi-Ordering , 2015, Order.

[12] Dieter Kratsch,et al. Linear-time certifying recognition algorithms and forbidden induced subgraphs , 2007, Nord. J. Comput..

[13] Udi Rotics,et al. Clique-Width is NP-Complete , 2009, SIAM J. Discret. Math..

[14] Gábor Rudolf,et al. Minimal Universal Bipartite Graphs , 2007, Ars Comb..

[15] Signed: Date: , 2003 .