Map genus, forbidden maps, and monadic second-order logic.
Maps on surfaces and Galois groups
Minimal regular graphs with given girths and crossing numbers
This paper investigates on those smallest regular graphs with given girths and having small crossing numbers.
Minimal vertex degree sum of a 3-path in plane maps
Let wₖ be the minimum degree sum of a path on k vertices in a graph. We prove for normal plane maps that: (1) if w₂ = 6, then w₃ may be arbitrarily big, (2) if w₂ < 6, then either w₃ ≤ 18 or there is a ≤ 15-vertex adjacent to two 3-vertices, and (3) if w₂ < 7, then w₃ ≤ 17.
Minimale nicht in die Ringfläche einbettbare Graphen.
Minimum-area drawings of plane 3-trees.
Monoids and decay.
More canonical ordering.
Morphing planar graph drawings with bent edges.