| 2009 |
|---|
| 39 | EE | Kiyoshi Ando,
Yoshimi Egawa,
K. Kawarabayashi,
Matthias Kriesell:
On the number of 4-contractible edges in 4-connected graphs.
J. Comb. Theory, Ser. B 99(1): 97-109 (2009) |
| 2008 |
|---|
| 38 | EE | Kiyoshi Ando,
Yoshimi Egawa:
Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph.
Discrete Mathematics 308(16): 3449-3460 (2008) |
| 37 | EE | Kiyoshi Ando,
Yoshimi Egawa:
Edges not contained in triangles and the number of contractible edges in a 4-connected graph.
Discrete Mathematics 308(23): 5463-5472 (2008) |
| 36 | EE | Yoshimi Egawa,
Shinya Fujita,
Katsuhiro Ota:
K1, 3-factors in graphs.
Discrete Mathematics 308(24): 5965-5973 (2008) |
| 35 | EE | Yoshimi Egawa:
k-shredders in k-connected graphs.
Journal of Graph Theory 59(3): 239-259 (2008) |
| 34 | EE | Yoshimi Egawa,
Katsumi Inoue,
Ken-ichi Kawarabayashi:
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs.
SIAM J. Discrete Math. 21(4): 1061-1070 (2008) |
| 2007 |
|---|
| 33 | EE | Yoshimi Egawa,
Hikoe Enomoto,
Stanislav Jendrol,
Katsuhiro Ota,
Ingo Schiermeyer:
Independence number and vertex-disjoint cycles.
Discrete Mathematics 307(11-12): 1493-1498 (2007) |
| 2005 |
|---|
| 32 | EE | Yoshimi Egawa,
Shinya Fujita,
Ken-ichi Kawarabayashi,
Hong Wang:
Existence of two disjoint long cycles in graphs.
Discrete Mathematics 305(1-3): 154-169 (2005) |
| 2003 |
|---|
| 31 | EE | Kiyoshi Ando,
Yoshimi Egawa:
Maximum number of edges in a critically k-connected graph.
Discrete Mathematics 260(1-3): 1-25 (2003) |
| 30 | EE | Yoshimi Egawa,
Mariko Hagita,
Ken-ichi Kawarabayashi,
Hong Wang:
Covering vertices of a graph by k disjoint cycles.
Discrete Mathematics 270(1-3): 114-124 (2003) |
| 2002 |
|---|
| 29 | | Yoshimi Egawa,
Hikoe Enomoto,
Norihide Tokushige:
Graph decompositions through prescribed vertices without isolates.
Ars Comb. 62: (2002) |
| 28 | EE | Kiyoshi Ando,
Yoshimi Egawa,
Atsushi Kaneko,
Ken-ichi Kawarabayashi,
Haruhide Matsuda:
Path factors in claw-free graphs.
Discrete Mathematics 243(1-3): 195-200 (2002) |
| 27 | EE | Yoshimi Egawa,
Katsumi Inoue,
Ken-ichi Kawarabayashi:
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs.
Electronic Notes in Discrete Mathematics 11: 253-264 (2002) |
| 26 | EE | Jin Akiyama,
Kiyoshi Ando,
Yoshimi Egawa:
Graphs G for which both G and G- are Contraction Critically k-Connected.
Graphs and Combinatorics 18(4): 693-708 (2002) |
| 2001 |
|---|
| 25 | | Yoshimi Egawa,
Katsuhiro Ota:
Vertex-Disjoint Paths in Graphs.
Ars Comb. 61: (2001) |
| 1999 |
|---|
| 24 | | Yoshimi Egawa,
Katsumi Inoue:
Radius of (2k-1)-Connected Graphs.
Ars Comb. 51: (1999) |
| 23 | | Yoshimi Egawa,
Masahiko Miyamoto:
Graph Labelings in Boolean Lattices.
Ars Comb. 52: (1999) |
| 22 | EE | Yoshimi Egawa,
Katsuhiro Ota:
Vertex-disjoint claws in graphs.
Discrete Mathematics 197-198: 225-246 (1999) |
| 1998 |
|---|
| 21 | EE | Yoshimi Egawa:
Contractible Cycles in Graphs with Girth at Least 5.
J. Comb. Theory, Ser. B 74(2): 213-264 (1998) |
| 1997 |
|---|
| 20 | EE | Kiyoshi Ando,
Yoshimi Egawa:
The minimum number of edges in a vertex diameter-2-critical graph.
Discrete Mathematics 167-168: 35-63 (1997) |
| 19 | EE | Yoshimi Egawa:
Contractible cycles in graphs with large minimum degree.
Discrete Mathematics 171(1-3): 103-119 (1997) |
| 1996 |
|---|
| 18 | EE | Yoshimi Egawa,
Mikio Kano:
Sufficient conditions for graphs to have (g, f)-factors.
Discrete Mathematics 151(1-3): 87-90 (1996) |
| 17 | EE | Yoshimi Egawa:
Vertex-Disjoint Cycles of the Same Length.
J. Comb. Theory, Ser. B 66(2): 168-200 (1996) |
| 1995 |
|---|
| 16 | | Yoshimi Egawa,
Katsuhiro Ota,
Akira Saito,
Xingxing Yu:
Non-Contractible Edges in A 3-Connected Graph.
Combinatorica 15(3): 357-364 (1995) |
| 1992 |
|---|
| 15 | EE | Yoshimi Egawa,
Preben D. Vestergaard:
Spanning trees in a cactus.
Discrete Mathematics 110(1-3): 269-274 (1992) |
| 1991 |
|---|
| 14 | | Yoshimi Egawa,
Atsushi Kaneko,
Makoto Matsumoto:
A mixed version of Menger's theorem.
Combinatorica 11(1): 71-74 (1991) |
| 13 | | Yoshimi Egawa,
Akira Saito:
Contractible edges in non-separating cycles.
Combinatorica 11(4): 389-392 (1991) |
| 12 | EE | Yoshimi Egawa,
R. Glas,
Stephen C. Locke:
Cycles and paths through specified vertices in k-connected graphs.
J. Comb. Theory, Ser. B 52(1): 20-29 (1991) |
| 1989 |
|---|
| 11 | EE | Yoshimi Egawa,
Takashi Miyamoto:
The longest cycles in a graph G with minimum degree at least |G|/k.
J. Comb. Theory, Ser. B 46(3): 356-362 (1989) |
| 1988 |
|---|
| 10 | EE | Yoshimi Egawa,
Hikoe Enomoto,
Akira Saito:
Factors and induced subgraphs.
Discrete Mathematics 68(2-3): 179-189 (1988) |
| 9 | EE | Jin Akiyama,
Yoshimi Egawa,
Hikoe Enomoto:
Preface.
Discrete Mathematics 72(1-3): 1-2 (1988) |
| 1987 |
|---|
| 8 | EE | Kiyoshi Ando,
Yoshimi Egawa,
Hirobumi Mizuno:
Graphs G for which G and _G are both semidecomposable.
Discrete Mathematics 65(2): 109-114 (1987) |
| 7 | EE | Yoshimi Egawa:
Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph.
J. Comb. Theory, Ser. B 42(3): 371-377 (1987) |
| 1986 |
|---|
| 6 | | Yoshimi Egawa,
Hikoe Enomoto,
Akira Saito:
Contracible edges in triangle-free graphs.
Combinatorica 6(3): 269-274 (1986) |
| 5 | EE | Yoshimi Egawa,
Masatsugu Urabe,
Toshihito Fukuda,
Seiichiro Nagoya:
A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components.
Discrete Mathematics 58(1): 93-95 (1986) |
| 4 | EE | Yoshimi Egawa:
Characterization of the cartesian product of complete graphs by convex subgraphs.
Discrete Mathematics 58(3): 307-309 (1986) |
| 1985 |
|---|
| 3 | | Yoshimi Egawa:
Association Schemes of Quadratic Forms.
J. Comb. Theory, Ser. A 38(1): 1-14 (1985) |
| 2 | EE | Noga Alon,
Yoshimi Egawa:
Even edge colorings of a graph.
J. Comb. Theory, Ser. B 38(1): 93-94 (1985) |
| 1981 |
|---|
| 1 | | Yoshimi Egawa:
Characterization of H(n, q) by the Parameters.
J. Comb. Theory, Ser. A 31(2): 108-125 (1981) |
