In this paper, we shall prove that a projective‐planar (resp., toroidal) triangulation G has K 6
as a minor if and only if G has no quadrangulation isomorphic to K 4 (resp., K 5 ) as a …

In this paper, we shall characterize triangulations on the Klein bottle without $K_6$-minors.
Our characterization implies that every 5-connected triangulation on the Klein bottle has a $…

In this paper, we shall give a constructive characterization of triangulations on the
nonorientable surface of genus 3 without K 6 -minors. Our characterization implies that every 5-…

For a positive integer k≥4, a graph G is called k-ordered, if for any ordered set of k distinct
vertices of G, G has a cycle that contains all the vertices in the designated order. Goddard (…

… Raiji Mukae1 … Mukae / Electronic Notes in Discrete Mathematics 31 (2008) 75–78 76 …
Mukae / Electronic Notes in Discrete Mathematics 31 (2008) 75–78 …

A graph G is said to be grid locatable if it admits a representation such that vertices are
mapped to grid points and edges to line segments that avoid grid points but the extremes. …

It is known that all planar graphs and all projective planar graphs have an edge partition
into three forests. Gonçalves proved that every planar graph has an edge partition into three …

This volume contains extended versions of selected communications presented at the XIV
Spanish Meeting on Computational Geometry, held in the University of Alcalá (Spain), during …

This Festschrift volume is published in honor of Ferran Hurtado on the occasion of his 60th
birthday; it contains extended versions of selected communications presented at the XIV …