#### Filter Results:

- Full text PDF available (63)

#### Publication Year

1967

2017

- This year (1)
- Last 5 years (21)
- Last 10 years (41)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jin Akiyama, Mikio Kano
- Journal of Graph Theory
- 1985

- Atsushi Kaneko, M. Kano
- 2003

In this paper, we give a short survey on discrete geometry on red and blue points in the plane, most of whose results were obtained in the past decade. We consider balanced subdivision problems, geometric graph problems, graph embedding problems, Gallai-type problems and others. 1 Notation and Definitions In this paper, we give a short survey on discrete… (More)

- Cui Yuting, Mikio Kano
- Journal of Graph Theory
- 1988

A {1, 3, · · · , 2n−1}-factor of a graph G is defined to be a spanning subgraph of G, each degree of whose vertices is one of {1, 3, · · · , 2n− 1}, where n is a positive integer. In this paper, we give a sufficient condition for a graph to have a {1, 3, · · · , 2n− 1}-factor.

- Jin Akiyama, Mikio Kano
- 2007

- Atsushi Amahashi, Mikio Kano
- Discrete Mathematics
- 1982

- Mikio Kano, Gyula Y. Katona, Zoltán Király
- Discrete Mathematics
- 2004

We give a simple proof for Kaneko’s theorem which gives a su2cient and necessary condition for the existence of vertex disjoint paths in a graph, each of length at least two, that altogether cover all vertices of the original graph. Moreover we generalize this theorem and give a formula for the maximum number of vertices that can be covered by such a path… (More)

- Mikio Kano, Akio Sakamoto
- Networks
- 1983

- Mikio Kano, Kazuhiro Suzuki, Miyuki Uno
- JCDCGG
- 2013

Let X be a set of multicolored points in the plane such that no three points are collinear and each color appears on at most ⌈|X|/2⌉ points. We show the existence of a non-crossing properly colored geometric perfect matching on X (if |X| is even), and the existence of a non-crossing properly colored geometric spanning tree with maximum degree at most 3 on… (More)

- Bernardo M. Ábrego, Esther M. Arkin, +4 authors Jorge Urrutia
- JCDCG
- 2004

We consider the following problem: For given two sets of red points and blue points in the plane respectively, we want to cover all these points with disjoint noncrossing alternating geometric paths of the same length. Determine the length of a path for which the above covering always exists under a trivial necessary condition on the numbers of red points… (More)