2009 |
11 | EE | Shinya Fujita,
Ken-ichi Kawarabayashi:
Note on non-separating and removable cycles in highly connected graphs.
Discrete Applied Mathematics 157(2): 398-399 (2009) |
2008 |
10 | EE | Shinya Fujita,
Tomoki Nakamigawa:
Balanced decomposition of a vertex-colored graph.
Discrete Applied Mathematics 156(18): 3339-3344 (2008) |
9 | EE | Yoshimi Egawa,
Shinya Fujita,
Katsuhiro Ota:
K1, 3-factors in graphs.
Discrete Mathematics 308(24): 5965-5973 (2008) |
8 | EE | Shinya Fujita:
Vertex-disjoint copies of K1+(K1 v K2) in claw-free graphs.
Discrete Mathematics 308(9): 1628-1633 (2008) |
7 | EE | Shinya Fujita,
Ken-ichi Kawarabayashi:
Connectivity keeping edges in graphs with large minimum degree.
J. Comb. Theory, Ser. B 98(4): 805-811 (2008) |
6 | EE | Shinya Fujita,
Ken-ichi Kawarabayashi:
Contractible elements in k-connected graphs not containing some specified graphs.
Journal of Graph Theory 58(2): 97-109 (2008) |
2007 |
5 | EE | Shinya Fujita,
Akira Saito,
Tomoki Yamashita:
Edge-dominating cycles in graphs.
Discrete Mathematics 307(23): 2934-2942 (2007) |
2006 |
4 | EE | Shinya Fujita,
Ken-ichi Kawarabayashi,
Cláudio Leonardo Lucchesi,
Katsuhiro Ota,
Michael D. Plummer,
Akira Saito:
A pair of forbidden subgraphs and perfect matchings.
J. Comb. Theory, Ser. B 96(3): 315-324 (2006) |
2005 |
3 | 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) |
2 | EE | Shinya Fujita:
Recent Results on Disjoint Cycles in Graphs.
Electronic Notes in Discrete Mathematics 22: 409-412 (2005) |
2002 |
1 | | Shinya Fujita:
Vertex-Disjoint K1, t's in Graphs.
Ars Comb. 64: 211- (2002) |