Electronic Notes in Discrete Mathematics, Volume 31

Volume 31, August 2008

• Patrice Ossona de Mendez, Michel Pocchiola, Dominique Poulalhon, Jorge L. Ramírez Alfonsín, Gilles Schaeffer:
  Preface. 1-4
  
• Arthur T. White:
  Topological Graph Theory: A Personal Account. 5-15
  
• Frédéric Demangeon, Patrice Ossona de Mendez:
  ... : The Way of the Bow. 17
  
• Jozef Sirán:
  Recent progress in classification of regular maps on a given compact surface. 19-22
  
• Thomas Tucker:
  Locally finite graphs and embeddings. 23-25
  
• Marston Conder:
  Genus spectra for symmetric embeddings of graphs on surfaces. 27-31
  
• Petra Mutzel:
  Recent Advances in Exact Crossing Minimization (Extended Abstract). 33-36
  
• Franz-Josef Brandenburg:
  Drawing Planar Graphs on (8/9)*n² Area. 37-40
  
• J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz:
  Characterizing Simultaneous Embedding with Fixed Edges. 41-44
  
• Anna Lubiw, Mark Petrick:
  Morphing Planar Graph Drawings with Bent Edges. 45-48
  
• Csaba D. Tóth:
  Connectivity augmentation in plane straight line graphs. 49-52
  
• Ignaz Rutter, Alexander Wolff:
  Augmenting the Connectivity of Planar and Geometric Graphs. 53-56
  
• Mireille Bousquet-Mélou:
  Counting coloured planar maps. 57-62
  
• Olivier Bernardi, Guillaume Chapuy:
  A bijection for covered maps on orientable surfaces. 63-68
  
• Nicolas Bonichon, Mireille Bousquet-Mélou, Éric Fusy:
  Baxter permutations and plane bipolar orientations. 69-74
  
• Raiji Mukae:
  K₆-Minors in triangulations on surfaces. 75-78
  
• Gasper Fijavz, David R. Wood:
  Minimum Degree and Graph Minors. 79-83
  
• Arnaud Labourel:
  On Universal Graphs of Minor Closed Families. 85-89
  
• Julia Böttcher, Klaas P. Pruessmann, Anusch Taraz, Andreas Würfl:
  Bandwidth, treewidth, separators, expansion, and universality. 91-96
  
• János Pach:
  On Simplices Embracing a Point. 97
  
• Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki:
  N-Flips in even triangulations on surfaces. 99-104
  
• Kenji Matsuoka:
  Looseness width of 5-connected triangulations on the torus. 105-108
  
• Luca Castelli Aleardi, Éric Fusy, Thomas Lewiner:
  Schnyder woods for higher genus triangulated surfaces (abstract). 109-114
  
• Mikhail E. Muzychuk:
  On balanced Cayley maps over abelian groups. 115-118
  
• Michel Las Vergnas:
  A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs. 119-122
  
• Romain Boulet, Etienne Fieux, Bertrand Jouve:
  s-homotopy for finite graphs. 123-127
  
• Marie-Françoise Roy:
  Quantitative results on quadratic semi-algebraic sets. 129
  
• Anton Dochtermann:
  Hom complexes and homotopy in the category of graphs. 131-136
  
• Masahiro Hachimori, Hiroshi Kurata, Tadashi Sakuma:
  Determining the minimum rank of matroids whose basis graph is common. 137-142
  
• Bernhard Haeupler, Robert Endre Tarjan:
  Planarity Algorithms via PQ-Trees (Extended Abstract). 143-149
  
• Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg:
  Connectivity check in 3-connected planar graphs with obstacles. 151-155
  
• S. A. Tishchenko:
  Maximum size of a planar graph with given degree and diameter. 157-159
  
• D. Gonçalves:
  Covering planar graphs with forests, one having a bounded maximum degree. 161-165
  
• Ricky Pollack:
  Allowable double-permutation sequences and double pseudoline arrangements. 167-168
  
• Hubert de Fraysseix:
  Trémaux Trees and Planarity. 169-180
  
• Jack Edmonds:
  On Finding Another. 181-182
  
• Frédéric Meunier:
  Polytopal complexes: maps, chain complexes and... necklaces. 183-188
  
• Axel Werner, Ronald F. Wotzlaw:
  Linkages in Polytope Graphs. 189-194
  
• Andreas Razen, Jack Snoeyink, Emo Welzl:
  Number of Crossing-Free Geometric Graphs vs. Triangulations. 195-200
  
• Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood:
  Compatible Geometric Matchings. 201-206
  
• Josef Cibulka:
  Untangling polygons and graphs. 207-211
  
• Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin, Stefan Langerman, David R. Wood:
  A Polynomial Bound for Untangling Geometric Planar Graphs. 213-218
  
• Yves Colin de Verdière:
  Symplectic geometry, minors and graph Laplacians. 219-220
  
• Antoine Deza, Tamás Terlaky, Feng Xie, Yuriy Zinchenko:
  Diameter and Curvature: Intriguing Analogies. 221-225
  
• Seiya Negami:
  Distinguishing Numbers and Re-emebedding Structures of Triangulations on Closed Surfaces. 227-230
  
• Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès:
  Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. 231-234
  
• Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický:
  Six-Critical Graphs on the Klein Bottle. 235-240
  
• D. Christopher Stephens, Xiaoya Zha:
  Spanning subsets of toroidal and Klein bottle embeddings. 241-242
  
• Atsuhiro Nakamoto:
  Geometric realization of a triangulation on the projective plane with one face removed. 243-246
  
• Jaroslav Nesetril:
  Structural Properties of Sparse Graphs. 247-251
  
• András Gyárfás:
  Ramsey and Turán-type problems in bipartite geometric graphs. 253-254
  
• Christian Avart, Péter Komjáth, Tomasz Luczak, Vojtech Rödl:
  Colorful Flowers. 255-258
  
• Matt DeVos, Bojan Mohar, Robert Sámal:
  Unexpected behaviour of crossing sequences. 259-264
  
• Jan Kyncl:
  Ramsey-type constructions for arrangements of segments. 265-269
  
• Petr Hlinený, Gelasio Salazar:
  Stars and Bonds in Crossing-Critical Graphs. 271-275
  
• Jan Kratochvíl, Martin Pergel:
  Intersection graphs of homothetic polygons. 277-280
  
• Bojan Mohar, Simon Spacapan:
  Coloring parameters for graphs on surfaces. 281-286
  
• Guillaume Damiand, Sylvie Alayrangues:
  Computing Canonical Polygonal Schemata with Generalized Maps. 287-292
  
• Mark N. Ellingham, Adam Weaver:
  Constructing all minimum genus embeddings of K_{3, n}. 293-298
  
• Ramón M. Figueroa-Centeno:
  Imbedding PG(m, q) with m+1 a prime. 299-304
  

Last update Wed Feb 15 05:31:32 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page