#### Filter Results:

#### Publication Year

1990

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

#### Method

#### Organism

Learn More

- 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. In this paper, we give a short survey on discrete geometry on red and blue… (More)

- Hikoe Enomoto, Jan van den Heuvel, Atsushi Kaneko, Akira Saito
- Journal of Graph Theory
- 1995

- Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki
- Journal of Graph Theory
- 2005

The tree partition number of an r-edge-colored graph G, denoted by t r (G), is the minimum number k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. We determine t 2 (K(n 1 , n 2 ,. .. , n k)) of the complete k-partite graph K(n 1 , n 2 ,. .. , n k). In… (More)

- Kiyoshi Ando, Atsushi Kaneko, Severino V. Gervacio
- Discrete Mathematics
- 1996

- Atsushi Kaneko
- Journal of Graph Theory
- 1998

- Atsushi Kaneko
- JCDCG
- 1998

- Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto
- Int. J. Comput. Geometry Appl.
- 2000

- Atsushi Kaneko, Alexander K. Kelmans, Tsuyoshi Nishimura
- Journal of Graph Theory
- 2001

- Atsushi Kaneko, Katsuhiro Ota
- J. Comb. Theory, Ser. B
- 2000

- Atsushi Kaneko, Kiyoshi Yoshimoto
- Journal of Graph Theory
- 2003