#### Filter Results:

- Full text PDF available (25)

#### Publication Year

1999

2017

- This year (1)
- Last 5 years (14)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Atsushi Kaneko, Kiyoshi Yoshimoto
- J. Comb. Theory, Ser. B
- 2001

- Atsushi Kaneko, Kiyoshi Yoshimoto
- Inf. Process. Lett.
- 2000

- Bill Jackson, Kiyoshi Yoshimoto
- Discrete Mathematics
- 2007

By Petersen’s theorem, a bridgeless cubic multigraph has a 2-factor. H. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing that every such multigraph has a spanning even subgraph. Our main result is that every bridgeless simple graph with minimum degree at least 3 has a spanning even subgraph in which… (More)

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

- Kiyoshi Yoshimoto
- Discrete Mathematics
- 2007

Given an integer λ ≥ 2, a graph G = (V,E) and a spanning subgraph H of G (the backbone of G), a λ-backbone coloring of (G,H) is a proper vertex coloring V → {1, 2, . . .} of G, in which the colors assigned to adjacent vertices in H differ by at least λ. We study the case where the backbone is either a collection of pairwise disjoint stars or a matching. We… (More)

- Bill Jackson, Kiyoshi Yoshimoto
- Journal of Graph Theory
- 2009

By Petersen’s theorem, a bridgeless cubic graph has a 2-factor. H. Fleischner extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has a spanning even subgraph. Our main result is that, under the stronger hypothesis of 3-edge-connectivity, we can find a spanning even subgraph in which every component… (More)

Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone coloring for G and H is a proper vertex coloring V → {1, 2, . . .} of G in which the colors assigned to adjacent vertices in H differ by at least two. In a recent paper, backbone colorings were introduced and studied in cases were the backbone is either a spanning tree… (More)

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

- M Salman, H J Broersma, +21 authors H A N M J Salman
- 2005

In this chapter we present some notations and give a survey of the existing results about three topics of graph theory that are considered in this thesis, namely: spanning 2-connected subgraphs of grid graphs, Ramsey numbers for paths versus other graphs, and a general framework for coloring problems. 1.1 Notation and terminology Throughout this thesis, we… (More)