Link homotopy invariants of graphs in R3.
In this paper we define a link homotopy invariant of spatial graphs based on the second degree coefficient of the Conway polynomial of a knot.
List 2-distance -coloring of planar graphs with girth 6 and .
Local properties and upper embeddability of connected multigraphs
Locally one-to-one mappings on graphs
Locally-cyclic graphs covering complete tripartite graphs
Long induced paths in 3-connected planar graphs
It is shown that every 3-connected planar graph with a large number of vertices has a long induced path.
Looseness and Independence Number of Triangulations on Closed Surfaces
The looseness of a triangulation G on a closed surface F2, denoted by ξ (G), is defined as the minimum number k such that for any surjection c : V (G) → {1, 2, . . . , k + 3}, there is a face uvw of G with c(u), c(v) and c(w) all distinct. We shall bound ξ (G) for triangulations G on closed surfaces by the independence number of G denoted by α(G). In particular, for a triangulation G on the sphere, we have [...] and this bound is sharp. For a triangulation G on a non-spherical surface F2, we have...
Low-distortion embeddings of trees.
Lower bounds for the average genus of a CF-graph.
Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.
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.
-locally connected graphs and their upper embeddability