Graph-Theoretic Concepts in Computer Science

Tree-Like Structures in Graphs: A Metric Point of View

[1]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[2]  Jérémie Chalopin,et al.  Every planar graph is the intersection graph of segments in the plane: extended abstract , 2009, STOC '09.

[3]  Ingo Schiermeyer,et al.  On maximum independent sets in P5-free graphs , 2010, Discret. Appl. Math..

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

[5]  Oded Schramm,et al.  Combinatorically Prescribed Packings and Applications to Conformal and Quasiconformal Maps , 2007, 0709.0710.

[6]  Ingo Wegener,et al.  Branching Programs and Binary Decision Diagrams , 1987 .

[7]  Ingo Schiermeyer,et al.  Vertex Colouring and Forbidden Subgraphs – A Survey , 2004, Graphs Comb..

[8]  David Schindl,et al.  Some new hereditary classes where graph coloring remains NP-hard , 2005, Discret. Math..

[9]  Ingo Wegener,et al.  NC-Algorithms for Operations on Binary Decision Diagrams , 1993, Parallel Process. Lett..

[10]  Daniel Sawitzki.  Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms , 2006, LATIN.

[11]  André Bouchet,et al.  Circle Graph Obstructions , 1994, J. Comb. Theory, Ser. B.

[12]  Éric Fusy,et al.  Transversal structures on triangulations: A combinatorial study and straight-line drawings , 2006, Discret. Math..

[13]  Günter Rote,et al.  Planar minimally rigid graphs and pseudo-triangulations , 2005, Comput. Geom..

[14]  Rolf H. Möhring,et al.  The Pathwidth and Treewidth of Cographs , 1990, SIAM J. Discret. Math..

[15]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[16]  Giuseppe Liotta,et al.  On Representing Graphs by Touching Cuboids , 2012, Graph Drawing.

[17]  Ivan Hal Sudborough,et al.  The Vertex Separation and Search Number of a Graph , 1994, Inf. Comput..

[18]  Stefan Felsner,et al.  Contact representations of planar graphs with cubes , 2011, SoCG '11.

[19]  Stefan Felsner,et al.  Lattice Structures from Planar Graphs , 2004, Electron. J. Comb..

[20]  J. Pach,et al.  Representation of planar graphs by segments , 1994 .

[21]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[22]  Arthur M. Farley,et al.  Obstructions for linear rankwidth at most 1 , 2011, ArXiv.

[23]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[24]  Steven Chaplick,et al.  Planar Graphs as VPG-Graphs , 2012, Graph Drawing.

[25]  Patrice Ossona de Mendez,et al.  On Triangle Contact Graphs , 1994, Combinatorics, Probability and Computing.

[26]  Dieter Kratsch,et al.  Treewidth and Pathwidth of Permutation Graphs , 1995, SIAM J. Discret. Math..

[27]  Robert Ganian.  Thread Graphs, Linear Rank-Width and Their Algorithmic Applications , 2010, IWOCA.

[28]  Martin Charles Golumbic,et al.  Vertex Intersection Graphs of Paths on a Grid , 2012, J. Graph Algorithms Appl..

[29]  Ton Kloks,et al.  Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs , 1993, J. Algorithms.

[30]  Paul D. Seymour,et al.  Monotonicity in Graph Searching , 1991, J. Algorithms.

[31]  Ingo Schiermeyer,et al.  A note on Brooks' theorem for triangle-free graphs , 2002, Australas. J Comb..

[32]  Stephen G. Kobourov,et al.  Combinatorial and Geometric Properties of Planar Laman Graphs , 2012, SODA.

[33]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[34]  Benjamin Lévêque,et al.  Triangle Contact Representations and Duality , 2010, Graph Drawing.

[35]  André Bouchet.  Transforming trees by successive local complementations , 1988, J. Graph Theory.