The SCEAS System
| |||||||

## Search the dblp DataBase
Yoshimi Egawa:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Yoshimi Egawa, Hikoe Enomoto, Norihide Tokushige
**Graph decompositions through prescribed vertices without isolates.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:62, n:, pp:- [Journal] - Yoshimi Egawa, Katsumi Inoue
**Radius of (2k-1)-Connected Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:51, n:, pp:- [Journal] - Yoshimi Egawa, Masahiko Miyamoto
**Graph Labelings in Boolean Lattices.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:52, n:, pp:- [Journal] - Yoshimi Egawa, Katsuhiro Ota
**Vertex-Disjoint Paths in Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2001, v:61, n:, pp:- [Journal] - Yoshimi Egawa, Hikoe Enomoto, Akira Saito
**Contracible edges in triangle-free graphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1986, v:6, n:3, pp:269-274 [Journal] - Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto
**A mixed version of Menger's theorem.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1991, v:11, n:1, pp:71-74 [Journal] - Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu
**Non-Contractible Edges in A 3-Connected Graph.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1995, v:15, n:3, pp:357-364 [Journal] - Yoshimi Egawa, Akira Saito
**Contractible edges in non-separating cycles.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1991, v:11, n:4, pp:389-392 [Journal] - Kiyoshi Ando, Yoshimi Egawa
**Maximum number of edges in a critically**[Citation Graph (0, 0)][DBLP]*k*-connected graph. Discrete Mathematics, 2003, v:260, n:1-3, pp:1-25 [Journal] - Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
**Path factors in claw-free graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:243, n:1-3, pp:195-200 [Journal] - Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang
**Existence of two disjoint long cycles in graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:305, n:1-3, pp:154-169 [Journal] - Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang
**Covering vertices of a graph by k disjoint cycles.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:270, n:1-3, pp:114-124 [Journal] - Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol, Katsuhiro Ota, Ingo Schiermeyer
**Independence number and vertex-disjoint cycles.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:11-12, pp:1493-1498 [Journal] - Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa
**Graphs G for which both G and G**[Citation Graph (0, 0)][DBLP]^{-}are Contraction Critically k-Connected. Graphs and Combinatorics, 2002, v:18, n:4, pp:693-708 [Journal] - Noga Alon, Yoshimi Egawa
**Even edge colorings of a graph.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1985, v:38, n:1, pp:93-94 [Journal] - Yoshimi Egawa
**Characterization of H(n, q) by the Parameters.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1981, v:31, n:2, pp:108-125 [Journal] - Yoshimi Egawa
**Association Schemes of Quadratic Forms.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1985, v:38, n:1, pp:1-14 [Journal] - Yoshimi Egawa
**Cycles in**[Citation Graph (0, 0)][DBLP]*k*-connected graphs whose deletion results in a (*k*-2)-connected graph. J. Comb. Theory, Ser. B, 1987, v:42, n:3, pp:371-377 [Journal] - Yoshimi Egawa
**Vertex-Disjoint Cycles of the Same Length.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:168-200 [Journal] - Yoshimi Egawa
**Contractible Cycles in Graphs with Girth at Least 5.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1998, v:74, n:2, pp:213-264 [Journal] - Yoshimi Egawa, R. Glas, Stephen C. Locke
**Cycles and paths through specified vertices in**[Citation Graph (0, 0)][DBLP]*k*-connected graphs. J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:20-29 [Journal] - Yoshimi Egawa, Takashi Miyamoto
**The longest cycles in a graph**[Citation Graph (0, 0)][DBLP]*G*with minimum degree at least |*G*|/*k*. J. Comb. Theory, Ser. B, 1989, v:46, n:3, pp:356-362 [Journal] - Yoshimi Egawa, Masatsugu Urabe, Toshihito Fukuda, Seiichiro Nagoya
**A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1986, v:58, n:1, pp:93-95 [Journal] - Yoshimi Egawa
**Characterization of the cartesian product of complete graphs by convex subgraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1986, v:58, n:3, pp:307-309 [Journal] - Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno
**Graphs G for which G and _G are both semidecomposable.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1987, v:65, n:2, pp:109-114 [Journal] - Yoshimi Egawa, Hikoe Enomoto, Akira Saito
**Factors and induced subgraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1988, v:68, n:2-3, pp:179-189 [Journal] - Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto
**Preface.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1988, v:72, n:1-3, pp:1-2 [Journal] - Yoshimi Egawa, Katsuhiro Ota
**Vertex-disjoint claws in graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:197, n:, pp:225-246 [Journal] - Yoshimi Egawa
**Contractible cycles in graphs with large minimum degree.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:171, n:1-3, pp:103-119 [Journal] - Kiyoshi Ando, Yoshimi Egawa
**The minimum number of edges in a vertex diameter-2-critical graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:167, n:, pp:35-63 [Journal] - Yoshimi Egawa, Preben D. Vestergaard
**Spanning trees in a cactus.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:110, n:1-3, pp:269-274 [Journal] - Yoshimi Egawa, Mikio Kano
**Sufficient conditions for graphs to have (g, f)-factors.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:151, n:1-3, pp:87-90 [Journal] **Edges not contained in triangles and the number of contractible edges in a 4-connected graph.**[Citation Graph (, )][DBLP]**K**[Citation Graph (, )][DBLP]_{1, 3}-factors in graphs.**Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph.**[Citation Graph (, )][DBLP]**Arbitrary decompositions into open and closed trails.**[Citation Graph (, )][DBLP]**5-Shredders in 5-connected graphs.**[Citation Graph (, )][DBLP]**4-factors in 2-connected star-free graphs.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |