The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 221 –
240 of
470
Let be a path on vertices. In an earlier paper we have proved that each polyhedral map on any compact -manifold with Euler characteristic contains a path such that each vertex of this path has, in , degree . Moreover, this bound is attained for or , even. In this paper we prove that for each odd , this bound is the best possible on infinitely many compact -manifolds, but on infinitely many other compact -manifolds the upper bound can be lowered to .
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.
It is shown that every 3-connected planar graph with a large number of vertices has a long induced path.
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...
This paper investigates on those smallest regular graphs with given girths and having small crossing numbers.
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.
Currently displaying 221 –
240 of
470