Precise lower bound for the number of edges of minor weight in planar maps
Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs
We prove that every planar graph with maximum degree ∆ is strong edge (2∆−1)-colorable if its girth is at least 40 [...] +1. The bound 2∆−1 is reached at any graph that has two adjacent vertices of degree ∆.
Primitive spatial graphs and graph minors.
Problèmes ouverts. Représentation graphique d'un graphe
Quadrilateral embeddings of the conjunction of graphs
Quantized dual graded graphs.
Radial level planarity testing and embedding in linear time.
Reconstructing Surface Triangulations by Their Intersection Matrices 26 September 2014
The intersection matrix of a simplicial complex has entries equal to the rank of the intersecction of its facets. We prove that this matrix is enough to define up to isomorphism a triangulation of a surface.
Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs.
Recurrence of distributional limits of finite planar graphs.
Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4
We describe how the simple planar quadrangulations with vertices of degree 3 and 4, whose duals are known as octahedrites, can all be obtained from an elementary family of starting graphs by repeatedly applying two expansion operations. This allows for construction of a linear time generator of all graphs in the class with at most a given order, up to isomorphism.
Relating different cycle spaces of the same infinite graph.
Remark about a construction of some tournaments points of certain projective planes
Remarks on diagonalizable embeddings of graphs
Representing of K13 as a 2-pire map on the Klein bottle.
Rotary hypermaps of genus 2.
Sachs triangulations, generated by dessins d'enfant, and regular maps
Self-dual planar hypergraphs and exact bond percolation thresholds.
Self-dual regular maps from medial graphs.
Semi-topological classification of line patterns in the plane