R. Bruce Richter

Orcid: 0000-0002-1444-9699

Affiliations:
  • University of Waterloo, Canada


According to our database1, R. Bruce Richter authored at least 95 papers between 1984 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Strong 3-Flow Conjecture for projective planar graphs.
J. Graph Theory, August, 2023

2022
Convex drawings of the complete graph: topology meets geometry.
Ars Math. Contemp., 2022

2021
Extending Drawings of Complete Graphs into Arrangements of Pseudocircles.
SIAM J. Discret. Math., 2021

Extending Drawings of Graphs to Arrangements of Pseudolines.
J. Comput. Geom., 2021

Drawings of complete graphs in the projective plane.
J. Graph Theory, 2021

Bounding the Number of Non-duplicates of the q-Side in Simple Drawings of K<sub>p, q</sub>.
Graphs Comb., 2021

2020
On 0-Rotatable Graceful Caterpillars.
Graphs Comb., 2020

2019
Peripheral circuits in infinite binary matroids.
J. Comb. Theory B, 2019

Graphs with at most one crossing.
Discret. Math., 2019

On α-labellings of lobsters and trees with a perfect matching.
Discret. Appl. Math., 2019

2018
Bishellable drawings of K<sub>n</sub>.
SIAM J. Discret. Math., 2018

Levi's Lemma, pseudolinear drawings of Kn, and empty triangles.
J. Graph Theory, 2018

Explicit bounds for graph minors.
J. Comb. Theory B, 2018

2017
Characterizing Graphs with Crossing Number at Least 2.
J. Graph Theory, 2017

Drawings of K<sub>n</sub> with the same rotation scheme are the same up to Reidemeister moves (Gioan's Theorem).
Australas. J Comb., 2017

2016
On the Crossing Number of Kn without Computer Assistance.
J. Graph Theory, 2016

The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the <i>n</i>-Cube.
J. Graph Theory, 2016

Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity.
Graphs Comb., 2016

Characterizing 2-crossing-critical graphs.
Adv. Appl. Math., 2016

2015
Embedding a Graph-Like Continuum in Some Surface.
J. Graph Theory, 2015

On the crossing number of K<sub>13</sub>.
J. Comb. Theory B, 2015

Embedding a graph-like continuum in a surface.
Comb., 2015

2014
Remarks on a Conjecture of Barát and Tóth.
Electron. J. Comb., 2014

Erratum to: Commentary for "On planarity of compact, locally connected, metric spaces".
Comb., 2014

2013
Zarankiewicz's Conjecture is finite for each fixed m.
J. Comb. Theory B, 2013

Hamilton paths in generalized Petersen graphs.
Discret. Math., 2013

The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2012
Self-dual and self-petrie-dual regular maps.
J. Graph Theory, 2012

Graphs obtained from Moufang loops and regular maps.
J. Graph Theory, 2012

2011
Asymptotically settling Zarankiewicz's Conjecture in finite time, for each m.
Electron. Notes Discret. Math., 2011

Graph-like spaces: An introduction.
Discret. Math., 2011

Relating Different Cycle Spaces of the Same Infinite Graph.
Electron. J. Comb., 2011

On planarity of compact, locally connected, metric spaces.
Comb., 2011

On 2-factors with long cycles in cubic graphs.
Ars Math. Contemp., 2011

2010
A Parity Theorem for Drawings of Complete and Complete Bipartite Graphs.
Am. Math. Mon., 2010

The Planarity Theorems of MacLane and Whitney for Graph-like Continua.
Electron. J. Comb., 2010

2008
Cycle spaces in topological spaces.
J. Graph Theory, 2008

The bond and cycle spaces of an infinite graph.
J. Graph Theory, 2008

2007
The crossing number of <i>K</i><sub>11</sub> is 100.
J. Graph Theory, 2007

Between ends and fibers.
J. Graph Theory, 2007

Triangular embeddings of complete graphs from graceful labellings of paths.
J. Comb. Theory B, 2007

The crossing number of P(10, 3) is six.
Ars Comb., 2007

The convex hull of every optimal pseudolinear drawing of K<sub>n</sub> is a triangle.
Australas. J Comb., 2007

2006
Improved Bounds for the Crossing Numbers of <i>K<sub>m, n</sub></i> and <i>K<sub>n</sub></i>.
SIAM J. Discret. Math., 2006

Erratum to 2-walks in 3-connected planar graphs.
Australas. J Comb., 2006

2005
Two maps with large representativity on one surface.
J. Graph Theory, 2005

Erratum to: Factorizations and characterizations of induced-hereditary and compositive properties.
J. Graph Theory, 2005

Factorizations and characterizations of induced-hereditary and compositive properties.
J. Graph Theory, 2005

Cayley maps.
J. Comb. Theory B, 2005

2004
To Adrian Bondy and U. S. R. Murty.
J. Comb. Theory B, 2004

Arrangements, circular arrangements and the crossing number of C<sub>7</sub>X C<sub>n</sub>.
J. Comb. Theory B, 2004

Embedding grids in surfaces.
Eur. J. Comb., 2004

Unique factorisation of additive induced-hereditary properties.
Discuss. Math. Graph Theory, 2004

Decomposing Infinite 2-Connected Graphs into 3-Connected Components.
Electron. J. Comb., 2004

Crossing numbers of sequences of graphs I: general tiles.
Australas. J Comb., 2004

2003
Crossing numbers of sequences of graphs II: Planar tiles.
J. Graph Theory, 2003

Graphs embedded in the plane with a bounded number of accumulation points.
J. Graph Theory, 2003

Fold-2-covering triangular embeddings.
J. Graph Theory, 2003

2002
On Essential and Inessential Polygons in Embedded Graphs.
J. Comb. Theory B, 2002

Colouring Eulerian Triangulations.
J. Comb. Theory B, 2002

Sewing Ribbons on Graphs in Space.
J. Comb. Theory B, 2002

The Crossing Number of P(N, 3).
Graphs Comb., 2002

2001
The crossing number of C<sub>6</sub> × C<sub>n</sub>.
Australas. J Comb., 2001

2000
Self-dual Cayley Maps.
Eur. J. Comb., 2000

1996
The crossing number of <i>K</i><sub>3, <i>n</i></sub> in a surface.
J. Graph Theory, 1996

The crossing number of <i>C</i><sub>5</sub> × <i>C<sub>n</sub></i>.
J. Graph Theory, 1996

Walks through every edge exactly twice II.
J. Graph Theory, 1996

Covering genus-reducing edges by Kuratowski subgraphs.
J. Graph Theory, 1996

Irreducible Triangulations of Surfaces.
J. Comb. Theory, Ser. B, 1996

Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings.
J. Comb. Theory B, 1996

Observations on maps and Δ-matroids.
Discuss. Math. Graph Theory, 1996

1995
Computing the orientable genus of projective graphs.
J. Graph Theory, 1995

The crossing number of c<sub>4</sub> × c<sub>4</sub>.
J. Graph Theory, 1995

Hamiltonicity of 5-Connected Toroidal Triangulations.
J. Graph Theory, 1995

Spanning Planar Subgraphs of Graphs in the Torus and Klein Bottle.
J. Comb. Theory B, 1995

Intersections of Curve Systems and the Crossing Number of C<sub>5</sub> X C<sub>5</sub>.
Discret. Comput. Geom., 1995

2-walks in 3-connected planar graphs.
Australas. J Comb., 1995

1994
Walks through every edge exactly twice.
J. Graph Theory, 1994

On 3-regular graphs having crossing number at least 2.
J. Graph Theory, 1994

Equality in a Result of Kleitman.
J. Comb. Theory A, 1994

2-Walks in Circuit Graphs.
J. Comb. Theory B, 1994

Circular embeddings of planar graphs in nonspherical surfaces.
Discret. Math., 1994

Branched coverings of maps and lifts of map homomorphisms.
Australas. J Comb., 1994

1993
Minimal Graphs with Crossing Number at Least <i>k</i>.
J. Comb. Theory B, 1993

1992
The construction and classification of self-dual spherical polyhedra.
J. Comb. Theory B, 1992

On the crossing numbers of certain generalized Petersen graphs.
Discret. Math., 1992

1991
Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces.
Discret. Math., 1991

Primal graphs with small degrees.
Discret. Math., 1991

1990
On the parity of planar covers.
J. Graph Theory, 1990

Nonplanar graphs and well-covered cycles.
Discret. Math., 1990

1988
Cubic graphs with crossing number two.
J. Graph Theory, 1988

On the parity of crossing numbers.
J. Graph Theory, 1988

1987
On the Euler genus of a 2-connected graph.
J. Comb. Theory B, 1987

On the non-orientable genus of a 2-connected graph.
J. Comb. Theory B, 1987

1984
Embedding graphs in surfaces.
J. Comb. Theory B, 1984


  Loading...