#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1981

2016

- This year (0)
- Last five years (12)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol, Katsuhiro Ota, Ingo Schiermeyer
- Discrete Mathematics
- 2007

In this paper we consider graphs which have no k vertex-disjoint cycles. For given integers k, let f (k,) be the maximum order of a graph G with independence number (G) , which has no k vertex-disjoint cycles. We prove that f (k,) = 3k + 2 − 3 if 1 5 or 1 k 2, and f (k,) 3k + 2 − 3 in general. We also prove the following results: (1) there exists a constant… (More)

- Yoshimi Egawa, Hikoe Enomoto, Ralph J. Faudree, Hao Li, Ingo Schiermeyer
- Journal of Graph Theory
- 2003

- Guantao Chen, Yoshimi Egawa, Xin Liu, Akira Saito
- Journal of Graph Theory
- 1996

- Béla Bollobás, Yoshimi Egawa, Andrew J. Harris, Guoping Jin
- Graphs and Combinatorics
- 1995

- Yoshimi Egawa, Katsuhiro Ota
- Journal of Graph Theory
- 1991

- Yoshimi Egawa, R. Glas, Stephen C. Locke
- J. Comb. Theory, Ser. B
- 1991

- Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang
- Graphs and Combinatorics
- 2000

- Yoshimi Egawa
- J. Comb. Theory, Ser. A
- 1981

- Yoshimi Egawa
- J. Comb. Theory, Ser. B
- 1996

Corradi and Hajnal proved that a graph of order at least 3k and minimum degree at least 2k contains k vertex-disjoint cycles. Häggkvist subsequently conjectured that a sufficiently large graph of minimum degree at least four contains two vertex-disjoint cycles of the same length. We prove that this conjecture is correct. In doing so, we give a short proof… (More)

- Yoshimi Egawa
- Graphs and Combinatorics
- 1991