Bojan Mohar

According to our database1, Bojan Mohar authored at least 248 papers between 1985 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Cops and robbers on oriented toroidal grids.
CoRR, 2019

Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12.
CoRR, 2019

Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
The Crossing Number of the Cone of a Graph.
SIAM J. Discrete Math., 2018

Bishellable drawings of Kn.
SIAM J. Discrete Math., 2018

Grünbaum colorings of even triangulations on surfaces.
Journal of Graph Theory, 2018

Finding a subdivision of a prescribed digraph of order 4.
Journal of Graph Theory, 2018

Game of cops and robbers in oriented quotients of the integer grid.
Discrete Mathematics, 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

Embedding graphs into two-dimensional simplicial complexes.
CoRR, 2018

Structure and generation of crossing-critical graphs.
CoRR, 2018

Minimal Normal Graph Covers.
Combinatorica, 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

Embedding Graphs into Two-Dimensional Simplicial Complexes.
Proceedings of the 34th International Symposium on Computational Geometry, 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. Discrete Math., 2017

Planar Digraphs of Digirth Five Are 2-Colorable.
Journal of Graph Theory, 2017

Hermitian Adjacency Matrix of Digraphs and Mixed Graphs.
Journal of Graph Theory, 2017

5-list-coloring planar graphs with distant precolored vertices.
J. Comb. Theory, Ser. B, 2017

5-choosability of graphs with crossings far apart.
J. Comb. Theory, Ser. B, 2017

Proper Orientations of Planar Bipartite Graphs.
Graphs and Combinatorics, 2017

Exponentially many nowhere-zero ℝ3-, ℝ4-, and ℝ6-flows.
Electronic Notes in Discrete Mathematics, 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.
Discrete Mathematics, 2017

Almost all regular graphs are normal.
Discrete Applied Mathematics, 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.
Australasian J. Combinatorics, 2017

Embedding quartic Eulerian digraphs on the plane.
Australasian J. Combinatorics, 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.
Journal of Graph Theory, 2016

Crossing Numbers of Periodic Graphs.
Journal of Graph Theory, 2016

Editorial.
J. Comb. Theory, Ser. B, 2016

Median Eigenvalues of Bipartite Subcubic Graphs.
Combinatorics, Probability & Computing, 2016

Planar digraphs of digirth four are 2-colourable.
CoRR, 2016

Graphic TSP in cubic graphs.
CoRR, 2016

Weak duality for packing edge-disjoint odd (u, v)-trails.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

The Crossing Number of the Cone of a Graph.
Proceedings of the Graph Drawing and Network Visualization, 2016

2015
Median eigenvalues and the HOMO-LUMO index of graphs.
J. Comb. Theory, Ser. B, 2015

Triangle-free subgraphs with large fractional chromatic number.
Electronic Notes in Discrete Mathematics, 2015

Drawing a disconnected graph on the torus (Extended abstract).
Electronic Notes in Discrete Mathematics, 2015

Corrigendum to "Many large eigenvalues in sparse graphs" [European J. Combin. 34(2013) 1125-1129].
Eur. J. Comb., 2015

Bishellable drawings of Kn.
CoRR, 2015

Highly arc-transitive digraphs - Structure and counterexamples.
Combinatorica, 2015

Four terminal planar Delta-Wye reducibility via rooted K2, 4 minors.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Homological Face-Width Condition Forcing K6-Minors in Graphs on Surfaces.
SIAM J. Discrete Math., 2014

Packing Triangles in Weighted Graphs.
SIAM J. Discrete Math., 2014

Integral Cayley Graphs and Groups.
SIAM J. Discrete Math., 2014

Interval minors of complete bipartite graphs.
CoRR, 2014

Ordering without forbidden patterns.
CoRR, 2014

A minimum degree condition forcing complete graph immersion.
Combinatorica, 2014

Ordering without Forbidden Patterns.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Digraph Girth via Chromatic Number.
SIAM J. Discrete 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.
Journal of Graph Theory, 2013

Star Chromatic Index.
Journal of Graph Theory, 2013

Many large eigenvalues in sparse graphs.
Eur. J. Comb., 2013

A Note on Forbidding Clique Immersions.
Electr. J. Comb., 2013

Integral Cayley Multigraphs over Abelian and Hamiltonian Groups.
Electr. J. Comb., 2013

Local chromatic number of quadrangulations of surfaces.
Combinatorica, 2013

Chromatic number and complete graph substructures for degree sequences.
Combinatorica, 2013

The excluded minor structure theorem with planarly embedded wall.
Ars Math. Contemp., 2013

2012
Planar Graphs Have Exponentially Many 3-Arboricities.
SIAM J. Discrete Math., 2012

Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs.
Journal of 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, Ser. B, 2012

Coloring Eulerian Triangulations of the Klein Bottle.
Graphs and Combinatorics, 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.
Discrete Mathematics, 2012

Linkless and Flat Embeddings in 3-Space.
Discrete & Computational Geometry, 2012

5-list-coloring planar graphs with distant precolored vertices
CoRR, 2012

Adding one edge to planar graphs makes crossing number and 1-planarity hard
CoRR, 2012

2011
Gallai's Theorem for List Coloring of Digraphs.
SIAM J. Discrete Math., 2011

The genus of Petersen powers.
Journal of Graph Theory, 2011

Unexpected behaviour of crossing sequences.
J. Comb. Theory, Ser. B, 2011

Asymptotic enumeration and limit laws for graphs of fixed genus.
J. Comb. Theory, Ser. A, 2011

Expected Crossing Numbers.
Electronic Notes in Discrete Mathematics, 2011

Preface.
Discrete Mathematics, 2011

Strengthened Brooks' Theorem for Digraphs of Girth at least Three.
Electr. J. Comb., 2011

Toughness of Ka,t-Minor-Free Graphs.
Electr. 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
Finding one tight cycle.
ACM Trans. Algorithms, 2010

Star Coloring and Acyclic Coloring of Locally Planar Graphs.
SIAM J. Discrete Math., 2010

Spectral radius of finite and infinite planar graphs and of graphs of bounded genus.
J. Comb. Theory, Ser. B, 2010

Crossing-critical graphs with large maximum degree.
J. Comb. Theory, Ser. B, 2010

Rigidity and Separation Indices of Graphs in Surfaces.
Graphs and Combinatorics, 2010

Strong embeddings of minimum genus.
Discrete Mathematics, 2010

Simplices and Spectra of Graphs.
Discrete & Computational Geometry, 2010

An Eberhard-Like Theorem for Pentagons and Heptagons.
Discrete & Computational Geometry, 2010

Spectrally degenerate graphs: Hereditary case
CoRR, 2010

Approximation algorithms via contraction decomposition.
Combinatorica, 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. Discrete Math., 2009

On the sum of k largest eigenvalues of graphs and symmetric matrices.
J. Comb. Theory, Ser. B, 2009

Cayley sum graphs and eigenvalues of (3, 6)-fullerenes.
J. Comb. Theory, Ser. B, 2009

Linear connectivity forces large complete bipartite minors.
J. Comb. Theory, Ser. B, 2009

Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]
J. Comb. Theory, Ser. B, 2009

Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract).
Electronic Notes in Discrete Mathematics, 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, Ser. B, 2008

Coloring parameters for graphs on surfaces.
Electronic Notes in Discrete Mathematics, 2008

Unexpected behaviour of crossing sequences.
Electronic Notes in Discrete Mathematics, 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

Finding one tight cycle.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Crossing and Weighted Crossing Number of Near-Planar Graphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 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. Discrete Math., 2007

A relaxed Hadwiger's Conjecture for list colorings.
J. Comb. Theory, Ser. B, 2007

Some Recent Progress and Applications in Graph Minor Theory.
Graphs and Combinatorics, 2007

Labeling planar graphs with a condition at distance two.
Eur. J. Comb., 2007

Research problems from the 5th Slovenian Conference (Bled, 2003).
Discrete Mathematics, 2007

Preface.
Discrete Mathematics, 2007

Heuristic search for Hamilton cycles in cubic graphs.
Discrete Mathematics, 2007

Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs.
Discrete & Computational Geometry, 2007

Obstructions for simple embeddings.
Australasian J. Combinatorics, 2007

Approximation algorithms via contraction decomposition.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
The Minor Crossing Number.
SIAM J. Discrete Math., 2006

Tree amalgamation of graphs and tessellations of the Cantor sphere.
J. Comb. Theory, Ser. 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 and Combinatorics, 2006

Small separations in vertex-transitive graphs.
Electronic Notes in Discrete Mathematics, 2006

Bar-Magnet Polyhedra and NS-Orientations of Maps.
Discrete & Computational Geometry, 2006

On Polyhedral Embeddings of Cubic Graphs.
Combinatorics, Probability & Computing, 2006

Graphs on Surfaces and Their Applications, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences 141, Springer-Verlag, 2004.
Combinatorics, Probability & Computing, 2006

Universal obstructions for embedding extension problems.
Australasian J. Combinatorics, 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.
Journal of Graph Theory, 2005

Acyclic colorings of locally planar graphs.
Eur. J. Comb., 2005

Foreword.
Eur. J. Comb., 2005

2-restricted extensions of partial embeddings of graphs.
Eur. J. Comb., 2005

Triangulations and the Hajós Conjecture.
Electr. J. Comb., 2005

Homotopic spanners.
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.
Proceedings of the Algorithms, 2005

2004
The circular chromatic number of a digraph.
Journal of Graph Theory, 2004

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs.
Journal of 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.
Discrete Mathematics, 2004

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

2003
Acyclic Homomorphisms and Circular Colorings of Digraphs.
SIAM J. Discrete Math., 2003

Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9.
Journal of Graph Theory, 2003

Circular colorings of edge-weighted graphs.
Journal of Graph Theory, 2003

Blocking nonorientability of a surface.
J. Comb. Theory, Ser. B, 2003

Preface.
Discussiones Mathematicae Graph Theory, 2003

On constant-weight TSP-tours.
Discussiones Mathematicae Graph Theory, 2003

On a list-coloring problem.
Discrete Mathematics, 2003

Domination, Packing and Excluded Minors.
Electr. J. Comb., 2003

K6-Minors in Projective Planar Graphs.
Combinatorica, 2003

2002
Coloring Locally Bipartite Graphs on Surfaces.
J. Comb. Theory, Ser. B, 2002

Long Cycles in Graphs on a Fixed Surface.
J. Comb. Theory, Ser. B, 2002

Ka, k Minors in Graphs of Bounded Tree-Width.
J. Comb. Theory, Ser. B, 2002

Labeled K2, t Minors in Plane Graphs.
J. Comb. Theory, Ser. B, 2002

Planar Graphs Without Cycles of Specific Lengths.
Eur. J. Comb., 2002

Coloring Eulerian triangulations of the projective plane.
Discrete Mathematics, 2002

On approximating the maximum diameter ratio of graphs.
Discrete Mathematics, 2002

Preface.
Discrete Mathematics, 2002

The Chromatic Number Of Graph Powers.
Combinatorics, Probability & Computing, 2002

2001
Flexibility of Polyhedral Embeddings of Graphs in Surfaces.
J. Comb. Theory, Ser. B, 2001

Face Covers and the Genus Problem for Apex Graphs.
J. Comb. Theory, Ser. B, 2001

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
Electronic Notes in Discrete Mathematics, 2001

Nowhere-zero k-flows of Supergraphs.
Electr. J. Comb., 2001

Existence of Polyhedral Embeddings of Graphs.
Combinatorica, 2001

Graphs on Surfaces.
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.
Journal of Graph Theory, 2000

Some Topological Methods in Graph Coloring Theory.
Electronic Notes in Discrete Mathematics, 2000

1999
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface.
SIAM J. Discrete Math., 1999

Graphs of degree 4 are 5-edge-choosable.
Journal of Graph Theory, 1999

Dirac's map-color theorem for choosability.
Journal of Graph Theory, 1999

The Grötzsch Theorem for the Hypergraph of Maximal Cliques.
Electr. J. Comb., 1999

List Edge-Colorings of Series-Parallel Graphs.
Electr. 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.
Discrete Mathematics, 1998

Preface.
Discrete Mathematics, 1998

The number of matchings of low order in hexagonal systems.
Discrete Mathematics, 1998

On list edge-colorings of subcubic graphs.
Discrete Mathematics, 1998

Tessellation and Visibility Representations of Maps on the Torus.
Discrete & Computational Geometry, 1998

List Total Colourings of Graphs.
Combinatorics, Probability & Computing, 1998

Obstruction Sets for Outer-Projective-Planar Graphs.
Ars Comb., 1998

1997
Obstructions For 2-Möbius Band Embedding Extension Problem.
SIAM J. Discrete Math., 1997

On the minimal genus of 2-complexes.
Journal of Graph Theory, 1997

Circle Packings of Maps in Polynomial Time.
Eur. J. Comb., 1997

Apex graphs with embeddings of face-width three.
Discrete Mathematics, 1997

Distance-related Invariants on Polygraphs.
Discrete Applied Mathematics, 1997

Projective Plane and Möbius Band Obstructions.
Combinatorica, 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, Ser. B, 1996

The Quasi-Wiener and the Kirchhoff Indices Coincide.
Journal of Chemical Information and Computer Sciences, 1996

Planar graphs on the projective plane.
Discrete Mathematics, 1996

Straight-line representations of maps on the torus and other flat surfaces.
Discrete Mathematics, 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
Coloring graph bundles.
Journal of Graph Theory, 1995

Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations.
Journal of Chemical Information and Computer Sciences, 1995

Fast computation of the Wiener index of fasciagraphs and rotagraphs.
Journal of Chemical Information and Computer Sciences, 1995

Bond Contributions to the Wiener Index.
Journal of Chemical Information and Computer Sciences, 1995

The chromatic numbers of graph bundles over cycles.
Discrete Mathematics, 1995

Uniqueness and Minimality of Large Face-Width Embeddings of Graphs.
Combinatorica, 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, Ser. B, 1994

Extremal Mono-q-polyhexes.
Journal of Chemical Information and Computer Sciences, 1994

Surface triangulations with isometric boundary.
Discrete Mathematics, 1994

Preface.
Discrete Mathematics, 1994

Convex Representations of Maps on the Torus and Other Flat Surfaces.
Discrete & Computational Geometry, 1994

Obstructions for the Disk and the Cylinder Embedding Extension Problems.
Combinatorics, Probability & Computing, 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.
Journal of Graph Theory, 1993

A novel definition of the Wiener index for trees.
Journal of Chemical Information and Computer Sciences, 1993

Projective Planarity in Linear Time.
J. Algorithms, 1993

A polynomial time circle packing algorithm.
Discrete Mathematics, 1993

7-critical graphs of bounded genus.
Discrete Mathematics, 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, Ser. B, 1992

Laplace eigenvalues of graphs - a survey.
Discrete Mathematics, 1992

A domain monotonicity theorem for graphs and Hamiltonicity.
Discrete Applied Mathematics, 1992

Optimal linear labelings and eigenvalues of graphs.
Discrete Applied Mathematics, 1992

1991
Eigenvalues, diameter, and mean distance in graphs.
Graphs and Combinatorics, 1991

Some relations between analytic and geometric properties of infinite graphs.
Discrete Mathematics, 1991

Disjoint Essential Circuits in Toroidal Maps.
Proceedings of the Planar Graphs, 1991

1990
Embeddings of cartesian products of nearly bipartite graphs.
Journal of Graph Theory, 1990

1989
Isoperimetric numbers of graphs.
J. Comb. Theory, Ser. B, 1989

An obstruction to embedding graphs in surfaces.
Discrete Mathematics, 1989

1988
Embeddings of infinite graphs.
J. Comb. Theory, Ser. B, 1988

The Maximum Genus of Graph Bundles.
Eur. J. Comb., 1988

Branced Covering.
Discrete & Computational Geometry, 1988

Nonorientable Genus of Nearly Complete Bipartite Graphs.
Discrete & Computational Geometry, 1988

1987
Simplicial schemes.
J. Comb. Theory, Ser. B, 1987

The enumeration of akempic triangulations.
J. Comb. Theory, Ser. B, 1987

1986
A common cover of graphs and 2-cell embeddings.
J. Comb. Theory, Ser. B, 1986

On the cycle space of graphs.
Discrete Mathematics, 1986

The matching polynomial of a polygraph.
Discrete Applied Mathematics, 1986

1985
Distance-biregular graphs with 2-valent vertices and distance-regular line graphs.
J. Comb. Theory, Ser. B, 1985

The cartesian product of three triangles can be embedded into a surface of genus 7.
Discrete Mathematics, 1985

Akempic triangulations with 4 odd vertices.
Discrete Mathematics, 1985


  Loading...