2024
List-Avoiding Orientations.
Comb., October, 2024
Treewidth, Circle Graphs, and Circular Drawings.
SIAM J. Discret. Math., March, 2024
Excluded minors for the Klein bottle I. Low connectivity case.
J. Comb. Theory B, January, 2024
Excluded minors for the Klein bottle II. Cascades.
J. Comb. Theory B, 2024
Guarding isometric subgraphs and cops and robber in planar graphs.
Eur. J. Comb., 2024
Cops and Robber on Hyperbolic Manifolds.
CoRR, 2024
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Exact Algorithms for Clustered Planarity with Linear Saturators.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024
Three-Edge-Coloring Projective Planar Cubic Graphs: A Generalization of the Four Color Theorem.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
2023
Proper orientations and proper chromatic number.
J. Comb. Theory B, July, 2023
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs.
SIAM J. Discret. Math., June, 2023
On the cop number of graphs of high girth.
J. Graph Theory, 2023
Robin Thomas (1962-2020).
J. Comb. Theory B, 2023
Expected number of faces in a random embedding of any graph is at most linear.
Comb. Probab. Comput., 2023
Graphs of Linear Growth have Bounded Treewidth.
Electron. J. Comb., 2023
2022
Subgraphs of Kneser graphs with large girth and large chromatic number.
Art Discret. Appl. Math., December, 2022
The evolution of the structure of ABC-minimal trees.
J. Comb. Theory B, 2022
The Sandpile Group of Polygon Rings and Twisted Polygon Rings.
Graphs Comb., 2022
Inducibility and universality for trees.
Comb. Theory, 2022
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12.
Comb., 2022
Embedding Graphs into Two-Dimensional Simplicial Complexes.
Comput. Geom. Topol., 2022
2021
Cops and robbers on oriented toroidal grids.
Theor. Comput. Sci., 2021
Meyniel's conjecture on graphs of bounded degree.
J. Graph Theory, 2021
Short rainbow cycles in graphs and matroids.
J. Graph Theory, 2021
The last temptation of William T. Tutte.
Eur. J. Comb., 2021
Reflexive coloring complexes for 3-edge-colorings of cubic graphs.
Discret. Math., 2021
Random 2-cell embeddings of multistars.
CoRR, 2021
The Inverse Voronoi Problem in Graphs II: Trees.
Algorithmica, 2021
Automorphisms and Isomorphisms of Maps in Linear Time.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
2020
Cops and Robbers on Graphs of Bounded Diameter.
SIAM J. Discret. Math., 2020
Fractional chromatic number of a random subgraph.
J. Graph Theory, 2020
Maximum number of colourings: 4-chromatic graphs.
J. Comb. Theory B, 2020
The genus of complete 3-uniform hypergraphs.
J. Comb. Theory B, 2020
Discret. Comput. Geom., 2020
Automorphism groups of maps in linear time.
CoRR, 2020
The Inverse Voronoi Problem in Graphs I: Hardness.
Algorithmica, 2020
Limiting Crossing Numbers for Geodesic Drawings on the Sphere.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020
2019
A Golden Ratio Inequality for Vertex Degrees of Graphs.
Am. Math. Mon., 2019
The sandpile group of a polygon flower.
Discret. Appl. Math., 2019
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12.
CoRR, 2019
Fractional Decompositions and the Smallest-eigenvalue Separation.
Electron. J. Comb., 2019
Maximum Number of Colourings: 5-Chromatic Case.
Electron. J. Comb., 2019
Exponentially Many Nowhere-Zero ℤ<sub>3</sub>-, ℤ<sub>4</sub>-, and ℤ<sub>6</sub>-Flows.
Comb., 2019
2018
The Crossing Number of the Cone of a Graph.
SIAM J. Discret. Math., 2018
Bishellable drawings of K<sub>n</sub>.
SIAM J. Discret. Math., 2018
Grünbaum colorings of even triangulations on surfaces.
J. Graph Theory, 2018
Finding a subdivision of a prescribed digraph of order 4.
J. Graph Theory, 2018
Game of cops and robbers in oriented quotients of the integer grid.
Discret. Math., 2018
The inverse Voronoi problem in graphs.
CoRR, 2018
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class.
CoRR, 2018
Short rainbow cycles in sparse graphs.
CoRR, 2018
Minimal Normal Graph Covers.
Comb., 2018
A submodular measure and approximate Gomory-Hu theorem for packing odd trails.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
Structure and Generation of Crossing-Critical Graphs.
Proceedings of the 34th International Symposium on Computational Geometry, 2018
2017
Planar Digraphs of Digirth Four are 2-Colorable.
SIAM J. Discret. Math., 2017
Planar Digraphs of Digirth Five Are 2-Colorable.
J. Graph Theory, 2017
Hermitian Adjacency Matrix of Digraphs and Mixed Graphs.
J. Graph Theory, 2017
5-list-coloring planar graphs with distant precolored vertices.
J. Comb. Theory B, 2017
5-choosability of graphs with crossings far apart.
J. Comb. Theory B, 2017
Proper Orientations of Planar Bipartite Graphs.
Graphs Comb., 2017
Exponentially many nowhere-zero ℝ<sub>3</sub>-, ℝ<sub>4</sub>-, and ℝ<sub>6</sub>-flows.
Electron. Notes Discret. Math., 2017
Obstructions for two-vertex alternating embeddings of graphs in surfaces.
Eur. J. Comb., 2017
Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths.
Discret. Math., 2017
Almost all regular graphs are normal.
Discret. Appl. Math., 2017
Topological directions in Cops and Robbers.
CoRR, 2017
Dan Archdeacon (11 May 1954 to 18 February 2015).
Ars Math. Contemp., 2017
Whitney's theorem for 2-regular planar digraphs.
Australas. J Comb., 2017
Embedding quartic Eulerian digraphs on the plane.
Australas. J Comb., 2017
Graphic TSP in Cubic Graphs.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017
2016
Interval Minors of Complete Bipartite Graphs.
J. Graph Theory, 2016
Crossing Numbers of Periodic Graphs.
J. Graph Theory, 2016
Median Eigenvalues of Bipartite Subcubic Graphs.
Comb. Probab. Comput., 2016
Planar digraphs of digirth four are 2-colourable.
CoRR, 2016
Weak duality for packing edge-disjoint odd (<i>u, v</i>)-trails.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
2015
Median eigenvalues and the HOMO-LUMO index of graphs.
J. Comb. Theory B, 2015
Triangle-free subgraphs with large fractional chromatic number.
Electron. Notes Discret. Math., 2015
Drawing a disconnected graph on the torus (Extended abstract).
Electron. Notes Discret. Math., 2015
Corrigendum to "Many large eigenvalues in sparse graphs" [European J. Combin. 34(2013) 1125-1129].
Eur. J. Comb., 2015
Highly arc-transitive digraphs - Structure and counterexamples.
Comb., 2015
Four terminal planar Delta-Wye reducibility via rooted <i>K</i><sub>2, 4</sub> minors.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
2014
Homological Face-Width Condition Forcing K<sub>6</sub>-Minors in Graphs on Surfaces.
SIAM J. Discret. Math., 2014
Packing Triangles in Weighted Graphs.
SIAM J. Discret. Math., 2014
Integral Cayley Graphs and Groups.
SIAM J. Discret. Math., 2014
A minimum degree condition forcing complete graph immersion.
Comb., 2014
Ordering without Forbidden Patterns.
Proceedings of the Algorithms - ESA 2014, 2014
2013
Digraph Girth via Chromatic Number.
SIAM J. Discret. Math., 2013
Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard.
SIAM J. Comput., 2013
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing.
J. Graph Theory, 2013
Many large eigenvalues in sparse graphs.
Eur. J. Comb., 2013
A Note on Forbidding Clique Immersions.
Electron. J. Comb., 2013
Integral Cayley Multigraphs over Abelian and Hamiltonian Groups.
Electron. J. Comb., 2013
Local chromatic number of quadrangulations of surfaces.
Comb., 2013
Chromatic number and complete graph substructures for degree sequences.
Comb., 2013
The excluded minor structure theorem with planarly embedded wall.
Ars Math. Contemp., 2013
2012
Planar Graphs Have Exponentially Many 3-Arboricities.
SIAM J. Discret. Math., 2012
Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs.
J. Graph Theory, 2012
Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph.
J. Graph Algorithms Appl., 2012
Spectrally degenerate graphs: Hereditary case.
J. Comb. Theory B, 2012
Coloring Eulerian Triangulations of the Klein Bottle.
Graphs Comb., 2012
Degenerate and star colorings of graphs on surfaces.
Eur. J. Comb., 2012
Immersing complete digraphs.
Eur. J. Comb., 2012
Two results on the digraph chromatic number.
Discret. Math., 2012
Linkless and Flat Embeddings in 3-Space.
Discret. Comput. Geom., 2012
2011
Gallai's Theorem for List Coloring of Digraphs.
SIAM J. Discret. Math., 2011
The genus of Petersen powers.
J. Graph Theory, 2011
Unexpected behaviour of crossing sequences.
J. Comb. Theory B, 2011
Asymptotic enumeration and limit laws for graphs of fixed genus.
J. Comb. Theory A, 2011
Expected Crossing Numbers.
Electron. Notes Discret. Math., 2011
Strengthened Brooks' Theorem for Digraphs of Girth at least Three.
Electron. J. Comb., 2011
Toughness of <i>K<sub>a,t</sub></i>-Minor-Free Graphs.
Electron. J. Comb., 2011
Crossing Number and Weighted Crossing Number of Near-Planar Graphs.
Algorithmica, 2011
On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011
2010
ACM Trans. Algorithms, 2010
Star Coloring and Acyclic Coloring of Locally Planar Graphs.
SIAM J. Discret. Math., 2010
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus.
J. Comb. Theory B, 2010
Crossing-critical graphs with large maximum degree.
J. Comb. Theory B, 2010
Rigidity and Separation Indices of Graphs in Surfaces.
Graphs Comb., 2010
Strong embeddings of minimum genus.
Discret. Math., 2010
Simplices and Spectra of Graphs.
Discret. Comput. Geom., 2010
An Eberhard-Like Theorem for Pentagons and Heptagons.
Discret. Comput. Geom., 2010
Approximation algorithms via contraction decomposition.
Comb., 2010
Immersing small complete graphs.
Ars Math. Contemp., 2010
Do We Really Understand the Crossing Numbers?
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010
Linkless and flat embeddings in 3-space and the unknot problem.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
Adding one edge to planar graphs makes crossing number hard.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
2009
The Two-Coloring Number and Degenerate Colorings of Planar Graphs.
SIAM J. Discret. Math., 2009
On the sum of k largest eigenvalues of graphs and symmetric matrices.
J. Comb. Theory B, 2009
Cayley sum graphs and eigenvalues of (3, 6)-fullerenes.
J. Comb. Theory B, 2009
Linear connectivity forces large complete bipartite minors.
J. Comb. Theory B, 2009
Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]
J. Comb. Theory B, 2009
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract).
Electron. Notes Discret. Math., 2009
The genus crossing number.
Ars Math. Contemp., 2009
List-color-critical graphs on a fixed surface.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
2008
Locally planar graphs are 5-choosable.
J. Comb. Theory B, 2008
Coloring parameters for graphs on surfaces.
Electron. Notes Discret. Math., 2008
Relating embedding and coloring properties of snarks.
Ars Math. Contemp., 2008
Graph and map isomorphism and all polyhedral embeddings in linear time.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Crossing and Weighted Crossing Number of Near-Planar Graphs.
Proceedings of the Graph Drawing, 16th International Symposium, 2008
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
Improved upper bounds on the crossing number.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008
2007
Circular Coloring the Plane.
SIAM J. Discret. Math., 2007
A relaxed Hadwiger's Conjecture for list colorings.
J. Comb. Theory B, 2007
Some Recent Progress and Applications in Graph Minor Theory.
Graphs Comb., 2007
Labeling planar graphs with a condition at distance two.
Eur. J. Comb., 2007
Research problems from the 5th Slovenian Conference (Bled, 2003).
Discret. Math., 2007
Heuristic search for Hamilton cycles in cubic graphs.
Discret. Math., 2007
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs.
Discret. Comput. Geom., 2007
Obstructions for simple embeddings.
Australas. J Comb., 2007
2006
The Minor Crossing Number.
SIAM J. Discret. Math., 2006
Tree amalgamation of graphs and tessellations of the Cantor sphere.
J. Comb. Theory B, 2006
On the Crossing Number of Almost Planar Graphs.
Informatica (Slovenia), 2006
Expected Case for Projecting Points.
Informatica (Slovenia), 2006
Coloring Vertices and Faces of Locally Planar Graphs.
Graphs Comb., 2006
Small separations in vertex-transitive graphs.
Electron. Notes Discret. Math., 2006
Bar-Magnet Polyhedra and NS-Orientations of Maps.
Discret. Comput. Geom., 2006
On Polyhedral Embeddings of Cubic Graphs.
Comb. Probab. Comput., 2006
Graphs on Surfaces and Their Applications, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences 141, Springer-Verlag, 2004.
Comb. Probab. Comput., 2006
Universal obstructions for embedding extension problems.
Australas. J Comb., 2006
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
2005
Crossing numbers of Sierpinski-like graphs.
J. Graph Theory, 2005
Acyclic colorings of locally planar graphs.
Eur. J. Comb., 2005
2-restricted extensions of partial embeddings of graphs.
Eur. J. Comb., 2005
Triangulations and the Hajós Conjecture.
Electron. J. Comb., 2005
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005
2004
The circular chromatic number of a digraph.
J. Graph Theory, 2004
Subdivisions of large complete bipartite graphs and long induced paths in <i>k</i>-connected graphs.
J. Graph Theory, 2004
A Spectral Approach to Graphical Representation of Data.
Informatica (Slovenia), 2004
Cubic inflation, mirror graphs, regular maps, and partial cubes.
Eur. J. Comb., 2004
Rigidity and separation indices of Paley graphs.
Discret. Math., 2004
Hajós Theorem For Colorings Of Edge-Weighted Graphs.
Comb., 2004
2003
Acyclic Homomorphisms and Circular Colorings of Digraphs.
SIAM J. Discret. Math., 2003
Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9.
J. Graph Theory, 2003
Circular colorings of edge-weighted graphs.
J. Graph Theory, 2003
Blocking nonorientability of a surface.
J. Comb. Theory B, 2003
Discuss. Math. Graph Theory, 2003
On constant-weight TSP-tours.
Discuss. Math. Graph Theory, 2003
On a list-coloring problem.
Discret. Math., 2003
Domination, Packing and Excluded Minors.
Electron. J. Comb., 2003
K<sub>6</sub>-Minors in Projective Planar Graphs.
Comb., 2003
2002
Coloring Locally Bipartite Graphs on Surfaces.
J. Comb. Theory B, 2002
Long Cycles in Graphs on a Fixed Surface.
J. Comb. Theory B, 2002
<i>K</i><sub>a, k</sub> Minors in Graphs of Bounded Tree-Width.
J. Comb. Theory B, 2002
Labeled <i>K</i><sub>2, t</sub> Minors in Plane Graphs.
J. Comb. Theory B, 2002
Planar Graphs Without Cycles of Specific Lengths.
Eur. J. Comb., 2002
Coloring Eulerian triangulations of the projective plane.
Discret. Math., 2002
On approximating the maximum diameter ratio of graphs.
Discret. Math., 2002
The Chromatic Number Of Graph Powers.
Comb. Probab. Comput., 2002
2001
Flexibility of Polyhedral Embeddings of Graphs in Surfaces.
J. Comb. Theory B, 2001
Face Covers and the Genus Problem for Apex Graphs.
J. Comb. Theory B, 2001
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
Electron. Notes Discret. Math., 2001
Nowhere-zero k-flows of Supergraphs.
Electron. J. Comb., 2001
Existence of Polyhedral Embeddings of Graphs.
Comb., 2001
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.
J. Graph Theory, 2000
Some Topological Methods in Graph Coloring Theory.
Electron. Notes Discret. Math., 2000
1999
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface.
SIAM J. Discret. Math., 1999
Graphs of degree 4 are 5-edge-choosable.
J. Graph Theory, 1999
Dirac's map-color theorem for choosability.
J. Graph Theory, 1999
The Grötzsch Theorem for the Hypergraph of Maximal Cliques.
Electron. J. Comb., 1999
List Edge-Colorings of Series-Parallel Graphs.
Electron. J. Comb., 1999
Drawing Graphs in the Hyperbolic Plane.
Proceedings of the Graph Drawing, 7th International Symposium, 1999
1998
On the orientable genus of graphs with bounded nonorientable genus.
Discret. Math., 1998
The number of matchings of low order in hexagonal systems.
Discret. Math., 1998
On list edge-colorings of subcubic graphs.
Discret. Math., 1998
Tessellation and Visibility Representations of Maps on the Torus.
Discret. Comput. Geom., 1998
List Total Colourings of Graphs.
Comb. Probab. Comput., 1998
Obstruction Sets for Outer-Projective-Planar Graphs.
Ars Comb., 1998
1997
Obstructions For 2-Möbius Band Embedding Extension Problem.
SIAM J. Discret. Math., 1997
On the minimal genus of 2-complexes.
J. Graph Theory, 1997
Circle Packings of Maps in Polynomial Time.
Eur. J. Comb., 1997
Apex graphs with embeddings of face-width three.
Discret. Math., 1997
Distance-related Invariants on Polygraphs.
Discret. Appl. Math., 1997
Projective Plane and Möbius Band Obstructions.
Comb., 1997
1996
Disjoint Essential Cycles.
J. Comb. Theory, Ser. B, 1996
Planar Graphs on Nonplanar Surfaces.
J. Comb. Theory, Ser. B, 1996
Systems of Curves on Surfaces.
J. Comb. Theory, Ser. B, 1996
Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings.
J. Comb. Theory B, 1996
The Quasi-Wiener and the Kirchhoff Indices Coincide.
J. Chem. Inf. Comput. Sci., 1996
Planar graphs on the projective plane.
Discret. Math., 1996
Straight-line representations of maps on the torus and other flat surfaces.
Discret. Math., 1996
Embedding Graphs in an Arbitrary Surface in Linear Time.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996
1995
Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations.
J. Chem. Inf. Comput. Sci., 1995
Fast computation of the Wiener index of fasciagraphs and rotagraphs.
J. Chem. Inf. Comput. Sci., 1995
Bond Contributions to the Wiener Index.
J. Chem. Inf. Comput. Sci., 1995
The chromatic numbers of graph bundles over cycles.
Discret. Math., 1995
Uniqueness and Minimality of Large Face-Width Embeddings of Graphs.
Comb., 1995
Embedding Graphs in the Torus in Linear Time.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
1994
Coloring Graphs without Short Non-bounding Cycles.
J. Comb. Theory B, 1994
Extremal Mono-q-polyhexes.
J. Chem. Inf. Comput. Sci., 1994
Surface triangulations with isometric boundary.
Discret. Math., 1994
Convex Representations of Maps on the Torus and Other Flat Surfaces.
Discret. Comput. Geom., 1994
Obstructions for the Disk and the Cylinder Embedding Extension Problems.
Comb. Probab. Comput., 1994
A Flow Approach to Upward Drawings of Toroidal Maps.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
1993
Circle packing representation in the plane and other surfaces.
SIGACT News, 1993
Laplace eigenvalues and bandwidth-type invariants of graphs.
J. Graph Theory, 1993
A novel definition of the Wiener index for trees.
J. Chem. Inf. Comput. Sci., 1993
Projective Planarity in Linear Time.
J. Algorithms, 1993
A polynomial time circle packing algorithm.
Discret. Math., 1993
7-critical graphs of bounded genus.
Discret. Math., 1993
A spectral approach to bandwidth and separator problems in graphs.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993
1992
Generating locally cyclic triangulations of surfaces.
J. Comb. Theory B, 1992
Laplace eigenvalues of graphs - a survey.
Discret. Math., 1992
A domain monotonicity theorem for graphs and Hamiltonicity.
Discret. Appl. Math., 1992
Optimal linear labelings and eigenvalues of graphs.
Discret. Appl. Math., 1992
1991
Eigenvalues, diameter, and mean distance in graphs.
Graphs Comb., 1991
Some relations between analytic and geometric properties of infinite graphs.
Discret. Math., 1991
Disjoint Essential Circuits in Toroidal Maps.
Proceedings of the Planar Graphs, 1991
1990
Embeddings of cartesian products of nearly bipartite graphs.
J. Graph Theory, 1990
1989
Isoperimetric numbers of graphs.
J. Comb. Theory B, 1989
An obstruction to embedding graphs in surfaces.
Discret. Math., 1989
1988
Embeddings of infinite graphs.
J. Comb. Theory B, 1988
The Maximum Genus of Graph Bundles.
Eur. J. Comb., 1988
Discret. Comput. Geom., 1988
Nonorientable Genus of Nearly Complete Bipartite Graphs.
Discret. Comput. Geom., 1988
1987
The enumeration of akempic triangulations.
J. Comb. Theory B, 1987
1986
A common cover of graphs and 2-cell embeddings.
J. Comb. Theory B, 1986
On the cycle space of graphs.
Discret. Math., 1986
The matching polynomial of a polygraph.
Discret. Appl. Math., 1986
1985
Distance-biregular graphs with 2-valent vertices and distance-regular line graphs.
J. Comb. Theory B, 1985
The cartesian product of three triangles can be embedded into a surface of genus 7.
Discret. Math., 1985
Akempic triangulations with 4 odd vertices.
Discret. Math., 1985
