Bojan Mohar

Comb. Probab. Comput., 2006

Universal obstructions for embedding extension problems.

[BibT_eX]

[DOI]

Australas. J Comb., 2006

Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005

Crossing numbers of Sierpinski-like graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Acyclic colorings of locally planar graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2005

Foreword.

[BibT_eX]

[DOI]

Eur. J. Comb., 2005

2-restricted extensions of partial embeddings of graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2005

Triangulations and the Hajós Conjecture.

[BibT_eX]

[DOI]

Electron. J. Comb., 2005

Homotopic spanners.

[BibT_eX]

[DOI]

Sergio Cabello

Arjana Zitnik

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs.

[BibT_eX]

[DOI]

Sergio Cabello

Proceedings of the Algorithms, 2005

2004

The circular chromatic number of a digraph.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

A Spectral Approach to Graphical Representation of Data.

[BibT_eX]

Drago Bokal

Informatica (Slovenia), 2004

Cubic inflation, mirror graphs, regular maps, and partial cubes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2004

Rigidity and separation indices of Paley graphs.

[BibT_eX]

[DOI]

Gasper Fijavz

Discret. Math., 2004

Hajós Theorem For Colorings Of Edge-Weighted Graphs.

[BibT_eX]

[DOI]

Comb., 2004

2003

Acyclic Homomorphisms and Circular Colorings of Digraphs.

[BibT_eX]

[DOI]

Tomás Feder

Pavol Hell

SIAM J. Discret. Math., 2003

Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9.

[BibT_eX]

[DOI]

Heinz-Jürgen Voss

J. Graph Theory, 2003

Circular colorings of edge-weighted graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Blocking nonorientability of a surface.

[BibT_eX]

[DOI]

Alexander Schrijver

J. Comb. Theory B, 2003

Preface.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2003

On constant-weight TSP-tours.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2003

On a list-coloring problem.

[BibT_eX]

[DOI]

Sylvain Gravier

Frédéric Maffray

Discret. Math., 2003

Domination, Packing and Excluded Minors.

[BibT_eX]

[DOI]

Electron. J. Comb., 2003

K6-Minors in Projective Planar Graphs.

[BibT_eX]

[DOI]

Gasper Fijavz

Comb., 2003

2002

Coloring Locally Bipartite Graphs on Surfaces.

[BibT_eX]

[DOI]

Paul D. Seymour

J. Comb. Theory B, 2002

Long Cycles in Graphs on a Fixed Surface.

[BibT_eX]

[DOI]

Carsten Thomassen

J. Comb. Theory B, 2002

Ka, k Minors in Graphs of Bounded Tree-Width.

[BibT_eX]

[DOI]

John Maharry

J. Comb. Theory B, 2002

Labeled K2, t Minors in Plane Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

Planar Graphs Without Cycles of Specific Lengths.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

Coloring Eulerian triangulations of the projective plane.

[BibT_eX]

[DOI]

Discret. Math., 2002

On approximating the maximum diameter ratio of graphs.

[BibT_eX]

[DOI]

Joze Marincek

Discret. Math., 2002

Preface.

[BibT_eX]

[DOI]

Dragan Marusic

Discret. Math., 2002

The Chromatic Number Of Graph Powers.

[BibT_eX]

[DOI]

Noga Alon

Comb. Probab. Comput., 2002

2001

Flexibility of Polyhedral Embeddings of Graphs in Surfaces.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Face Covers and the Genus Problem for Apex Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Nowhere-zero k-flows of Supergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

Existence of Polyhedral Embeddings of Graphs.

[BibT_eX]

[DOI]

Comb., 2001

Graphs on Surfaces.

[BibT_eX]

[DOI]

Carsten Thomassen

Johns Hopkins series in the mathematical sciences, Johns Hopkins University Press, ISBN: 978-0-8018-6689-0, 2001

2000

Light paths in 4-connected graphs in the plane and other surfaces.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Some Topological Methods in Graph Coloring Theory.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

1999

A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

Graphs of degree 4 are 5-edge-choosable.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Dirac's map-color theorem for choosability.

[BibT_eX]

[DOI]

Michael Stiebitz

J. Graph Theory, 1999

The Grötzsch Theorem for the Hypergraph of Maximal Cliques.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

List Edge-Colorings of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Robin Thomas

Electron. J. Comb., 1999

Drawing Graphs in the Hyperbolic Plane.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

On the orientable genus of graphs with bounded nonorientable genus.

[BibT_eX]

[DOI]

Discret. Math., 1998

Preface.

[BibT_eX]

[DOI]

Dragan Marusic

Discret. Math., 1998

The number of matchings of low order in hexagonal systems.

[BibT_eX]

[DOI]

Diego Klabjan

Discret. Math., 1998

On list edge-colorings of subcubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

Tessellation and Visibility Representations of Maps on the Torus.

[BibT_eX]

[DOI]

Pierre Rosenstiehl

Discret. Comput. Geom., 1998

List Total Colourings of Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

Obstruction Sets for Outer-Projective-Planar Graphs.

[BibT_eX]

Ars Comb., 1998

1997

Obstructions For 2-Möbius Band Embedding Extension Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1997

On the minimal genus of 2-complexes.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

Circle Packings of Maps in Polynomial Time.

[BibT_eX]

[DOI]

Eur. J. Comb., 1997

Apex graphs with embeddings of face-width three.

[BibT_eX]

[DOI]

Discret. Math., 1997

Distance-related Invariants on Polygraphs.

[BibT_eX]

[DOI]

Janez Zerovnik

Discret. Appl. Math., 1997

Projective Plane and Möbius Band Obstructions.

[BibT_eX]

[DOI]

Comb., 1997

1996

Disjoint Essential Cycles.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

Planar Graphs on Nonplanar Surfaces.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

Systems of Curves on Surfaces.

[BibT_eX]

[DOI]

Aleksander Malnic

J. Comb. Theory, Ser. B, 1996

Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings.

[BibT_eX]

[DOI]

Richard Brunet

R. Bruce Richter

J. Comb. Theory B, 1996

The Quasi-Wiener and the Kirchhoff Indices Coincide.

[BibT_eX]

[DOI]

Ivan Gutman

J. Chem. Inf. Comput. Sci., 1996

Planar graphs on the projective plane.

[BibT_eX]

[DOI]

Richard P. Vitray

Discret. Math., 1996

Straight-line representations of maps on the torus and other flat surfaces.

[BibT_eX]

[DOI]

Discret. Math., 1996

Embedding Graphs in an Arbitrary Surface in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

Coloring graph bundles.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations.

[BibT_eX]

[DOI]

Ivan Gutman

J. Chem. Inf. Comput. Sci., 1995

Fast computation of the Wiener index of fasciagraphs and rotagraphs.

[BibT_eX]

[DOI]

J. Chem. Inf. Comput. Sci., 1995

Bond Contributions to the Wiener Index.

[BibT_eX]

[DOI]

J. Chem. Inf. Comput. Sci., 1995

The chromatic numbers of graph bundles over cycles.

[BibT_eX]

[DOI]

Discret. Math., 1995

Uniqueness and Minimality of Large Face-Width Embeddings of Graphs.

[BibT_eX]

[DOI]

Comb., 1995

Embedding Graphs in the Torus in Linear Time.

[BibT_eX]

[DOI]

Joze Marincek

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

Coloring Graphs without Short Non-bounding Cycles.

[BibT_eX]

[DOI]

Steve Fisk

J. Comb. Theory B, 1994

Extremal Mono-q-polyhexes.

[BibT_eX]

[DOI]

J. Chem. Inf. Comput. Sci., 1994

Surface triangulations with isometric boundary.

[BibT_eX]

[DOI]

Steve Fisk

Discret. Math., 1994

Preface.

[BibT_eX]

[DOI]

Discret. Math., 1994

Convex Representations of Maps on the Torus and Other Flat Surfaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1994

Obstructions for the Disk and the Cylinder Embedding Extension Problems.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

A Flow Approach to Upward Drawings of Toroidal Maps.

[BibT_eX]

[DOI]

Pierre Rosenstiehl

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Circle packing representation in the plane and other surfaces.

[BibT_eX]

[DOI]

SIGACT News, 1993

Laplace eigenvalues and bandwidth-type invariants of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

A novel definition of the Wiener index for trees.

[BibT_eX]

[DOI]

Darko Babic

Nenad Trinajstic

J. Chem. Inf. Comput. Sci., 1993

Projective Planarity in Linear Time.

[BibT_eX]

[DOI]

J. Algorithms, 1993

A polynomial time circle packing algorithm.

[BibT_eX]

[DOI]

Discret. Math., 1993

7-critical graphs of bounded genus.

[BibT_eX]

[DOI]

Discret. Math., 1993

A spectral approach to bandwidth and separator problems in graphs.

[BibT_eX]

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992

Generating locally cyclic triangulations of surfaces.

[BibT_eX]

[DOI]

Aleksander Malnic

J. Comb. Theory B, 1992

Laplace eigenvalues of graphs - a survey.

[BibT_eX]

[DOI]

Discret. Math., 1992

A domain monotonicity theorem for graphs and Hamiltonicity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Optimal linear labelings and eigenvalues of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1991

Eigenvalues, diameter, and mean distance in graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1991

Some relations between analytic and geometric properties of infinite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1991

Disjoint Essential Circuits in Toroidal Maps.

[BibT_eX]

[DOI]

Proceedings of the Planar Graphs, 1991

1990

Embeddings of cartesian products of nearly bipartite graphs.

[BibT_eX]

[DOI]

Tomaz Pisanski

Arthur T. White

J. Graph Theory, 1990

1989

Isoperimetric numbers of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1989

An obstruction to embedding graphs in surfaces.

[BibT_eX]

[DOI]

Discret. Math., 1989

1988

Embeddings of infinite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1988

The Maximum Genus of Graph Bundles.

[BibT_eX]

[DOI]

Tomaz Pisanski

Martin Skoviera

Eur. J. Comb., 1988

Branced Covering.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1988

Nonorientable Genus of Nearly Complete Bipartite Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1988

1987

Simplicial schemes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

The enumeration of akempic triangulations.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

1986

A common cover of graphs and 2-cell embeddings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

On the cycle space of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1986

The matching polynomial of a polygraph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

1985

Distance-biregular graphs with 2-valent vertices and distance-regular line graphs.

[BibT_eX]

[DOI]

John Shawe-Taylor

J. Comb. Theory B, 1985

The cartesian product of three triangles can be embedded into a surface of genus 7.

[BibT_eX]

[DOI]

Discret. Math., 1985

Akempic triangulations with 4 odd vertices.

[BibT_eX]

[DOI]