Yoshimi Egawa

	2012
51		Guantao Chen, Yoshimi Egawa, Ronald J. Gould, Akira Saito: Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs. Discrete Mathematics 312(5): 938-942 (2012)
	2011
50		Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota: Toughness of Ka,t-Minor-Free Graphs. Electr. J. Comb. 18(1): (2011)
49		Robert E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito: The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity. Journal of Graph Theory 68(1): 77-89 (2011)
	2009
48		Yoshimi Egawa, Keiko Kotani: 4-factors in 2-connected star-free graphs. Discrete Mathematics 309(21): 6265-6270 (2009)
47		Sylwia Cichacz, Yoshimi Egawa, Mariusz Wozniak: Arbitrary decompositions into open and closed trails. Discrete Mathematics 309(6): 1511-1516 (2009)
46		Yoshimi Egawa, Yumiko Okadome, Masanori Takatou: 5-Shredders in 5-connected graphs. Discrete Mathematics 309(6): 1565-1574 (2009)
45		Kiyoshi Ando, Yoshimi Egawa, Ken-ichi 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
44		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)
43		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)
42		Yoshimi Egawa, Shinya Fujita, Katsuhiro Ota: K1, 3-factors in graphs. Discrete Mathematics 308(24): 5965-5973 (2008)
41		Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto: On a Spanning Tree with Specified Leaves. Graphs and Combinatorics 24(1): 13-18 (2008)
40		Yoshimi Egawa: k-shredders in k-connected graphs. Journal of Graph Theory 59(3): 239-259 (2008)
39		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
38		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
37		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
36		Kiyoshi Ando, Yoshimi Egawa: Maximum number of edges in a critically k-connected graph. Discrete Mathematics 260(1-3): 1-25 (2003)
35		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
34		Yoshimi Egawa, Hikoe Enomoto, Norihide Tokushige: Graph decompositions through prescribed vertices without isolates. Ars Comb. 62: (2002)
33		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)
32		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)
31		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
30		Yoshimi Egawa, Katsuhiro Ota: Vertex-Disjoint Paths in Graphs. Ars Comb. 61: (2001)
	2000
29		Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang: Vertex-Disjoint Cycles Containing Specified Edges. Graphs and Combinatorics 16(1): 81-92 (2000)
	1999
28		Yoshimi Egawa, Katsumi Inoue: Radius of (2k-1)-Connected Graphs. Ars Comb. 51: (1999)
27		Yoshimi Egawa, Masahiko Miyamoto: Graph Labelings in Boolean Lattices. Ars Comb. 52: (1999)
26		Yoshimi Egawa, Katsuhiro Ota: Vertex-disjoint claws in graphs. Discrete Mathematics 197-198: 225-246 (1999)
	1998
25		Yoshimi Egawa: Contractible Cycles in Graphs with Girth at Least 5. J. Comb. Theory, Ser. B 74(2): 213-264 (1998)
	1997
24		Kiyoshi Ando, Yoshimi Egawa: The minimum number of edges in a vertex diameter-2-critical graph. Discrete Mathematics 167-168: 35-63 (1997)
23		Yoshimi Egawa: Contractible cycles in graphs with large minimum degree. Discrete Mathematics 171(1-3): 103-119 (1997)
	1996
22		Yoshimi Egawa, Mikio Kano: Sufficient conditions for graphs to have (g, f)-factors. Discrete Mathematics 151(1-3): 87-90 (1996)
21		Yoshimi Egawa: Vertex-Disjoint Cycles of the Same Length. J. Comb. Theory, Ser. B 66(2): 168-200 (1996)
	1995
20		Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu: Non-Contractible Edges in A 3-Connected Graph. Combinatorica 15(3): 357-364 (1995)
19		Béla Bollobás, Yoshimi Egawa, Andrew J. Harris, Guoping Jin: The maximal number of inducedr-partite subgraphs. Graphs and Combinatorics 11(1): 1-19 (1995)
	1992
18		Yoshimi Egawa, Preben D. Vestergaard: Spanning trees in a cactus. Discrete Mathematics 110(1-3): 269-274 (1992)
	1991
17		Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto: A mixed version of Menger's theorem. Combinatorica 11(1): 71-74 (1991)
16		Yoshimi Egawa, Akira Saito: Contractible edges in non-separating cycles. Combinatorica 11(4): 389-392 (1991)
15		Yoshimi Egawa: Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4]. Graphs and Combinatorics 7(1): 15-21 (1991)
14		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
13		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
12		Yoshimi Egawa, Hikoe Enomoto, Akira Saito: Factors and induced subgraphs. Discrete Mathematics 68(2-3): 179-189 (1988)
11		Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto: Preface. Discrete Mathematics 72(1-3): 1-2 (1988)
	1987
10		Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno: Graphs G for which G and _G are both semidecomposable. Discrete Mathematics 65(2): 109-114 (1987)
9		Yoshimi Egawa, Takashi Miyamoto, Sergio Ruiz: On randomlyn-cyclic digraphs. Graphs and Combinatorics 3(1): 227-238 (1987)
8		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
7		Yoshimi Egawa, Hikoe Enomoto, Akira Saito: Contracible edges in triangle-free graphs. Combinatorica 6(3): 269-274 (1986)
6		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)
5		Yoshimi Egawa: Characterization of the cartesian product of complete graphs by convex subgraphs. Discrete Mathematics 58(3): 307-309 (1986)
4		Yoshimi Egawa, Hikoe Enomoto, Akira Saito: On component factors. Graphs and Combinatorics 2(1): 223-225 (1986)
	1985
3		Yoshimi Egawa: Association Schemes of Quadratic Forms. J. Comb. Theory, Ser. A 38(1): 1-14 (1985)
2		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)

Coauthor Index

1	Jin Akiyama	[11] [31]
2	Robert E. L. Aldred	[49]
3	Noga Alon	[2]
4	Kiyoshi Ando	[10] [24] [31] [33] [36] [43] [44] [45]
5	Béla Bollobás	[19]
6	Guantao Chen	[50] [51]
7	Sylwia Cichacz-Przenioslo (Sylwia Cichacz)	[47]
8	Hikoe Enomoto	[4] [7] [11] [12] [34] [38]
9	Ralph J. Faudree	[29]
10	Jun Fujisawa	[49]
11	Shinya Fujita	[37] [42]
12	Toshihito Fukuda	[6]
13	R. Glas	[14]
14	Ronald J. Gould	[51]
15	Ervin Györi	[29]
16	Mariko Hagita	[35]
17	Andrew J. Harris	[19]
18	Katsumi Inoue	[28] [32] [39]
19	Yoshiyasu Ishigami	[29]
20	Stanislav Jendrol	[38]
21	Guoping Jin	[19]
22	Atsushi Kaneko	[17] [33]
23	Mikio Kano (M. Kano)	[22]
24	Ken-ichi Kawarabayashi	[32] [33] [35] [37] [39] [45] [50]
25	Keiko Kotani	[48]
26	Matthias Kriesell	[45]
27	Stephen C. Locke	[14]
28	Haruhide Matsuda	[33] [41]
29	Makoto Matsumoto	[17]
30	Masahiko Miyamoto	[27]
31	Takashi Miyamoto	[9] [13]
32	Hirobumi Mizuno	[10]
33	Bojan Mohar	[50]
34	Seiichiro Nagoya	[6]
35	Yumiko Okadome	[46]
36	Katsuhiro Ota	[20] [26] [30] [38] [42] [49] [50]
37	Sergio Ruiz	[9]
38	Akira Saito	[4] [7] [12] [16] [20] [49] [51]
39	Richard H. Schelp	[29]
40	Ingo Schiermeyer	[38]
41	Masanori Takatou	[46]
42	Norihide Tokushige	[34]
43	Masatsugu Urabe	[6]
44	Preben D. Vestergaard	[18]
45	Hong Wang	[29] [35] [37]
46	Mariusz Wozniak	[47]
47	Tomoki Yamashita	[41]
48	Kiyoshi Yoshimoto (Kiyoshi Yoshiomoto)	[41]
49	Xingxing Yu	[20]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page