[1] S.Fujita, Vertex-disjoint

[2] S.Fujita, Vertex-disjoint copies of

[3] S.Fujita, Vertex-disjoint copies of

[4] S.Fujita, Partition of a graph into cycles and isolated vertices,

[5] S.Fujita (with Y.Egawa, K.Kawarabayashi, H.Wang ), Existence of two disjoint long cycles in graphs,

[6] S.Fujita (with A.Kaneko, I.Schiermeyer, K.Suzuki ), A rainbow matching in complete graphs and the number of colors,

[7] S.Fujita (with S.Chiba, Y.Egawa), Minimum number of edges guaranteeing the existence of a

[8] S.Fujita, On graphs

[9] S.Fujita (with J.Fujisawa, T. Yamashita), Heavy cycles in hamiltonian weighted graphs,

[10] S.Fujita (with H. Matsumura, M. Tsugaki, T. Yamashita), Degree sum conditions and vertex-disjoint cycles in a graph,

[11] S.Fujita, Forbidden pairs for vertex-disjoint claws,

[12] S.Fujita (with K. Kawarabayashi, C.L. Lucchesi, K. Ota, M. Plummer, A. Saito), A pair of forbidden subgraphs and perfect matchings,

[13] S.Fujita (with K. Kawarabayashi), Contractible elements in k-connected graphs not containing some specified graphs,

[14] S.Fujita, Disjoint stars and forbidden subgraphs,

[15] S.Fujita, Vertex-disjoint copies of

[16] S.Fujita, Degree conditions for the partition of a graph into cycles, edges and isolated vertices,

(PDF)

[17] S.Fujita (with T. Nakamigawa), Balanced decomposition of a vertex-colored graph,

[18] S.Fujita (with H. Liu), Further results on the balanced decomposition number,

[19] S.Fujita (with Y. Egawa, K. Ota),

[20] S.Fujita (with K. Kawarabayashi), Connectivity keeping edges in graphs with large minimum degree,

[21] S.Fujita (with A. Saito, T. Yamashita), Edge dominating cycles in graphs

[22] S.Fujita (with Y. Egawa, J. Fujisawa, K. Ota ), On 2-factors in r-connected {

[23] S.Fujita (with K. Kawarabayashi), Note on non-separating and removable cycles in highly connected graphs,

[24] S.Fujita (with A. Halperin, C. Magnant), Long path lemma concerning connectivity and independence number,

[25] S.Fujita (with K. Kawarabayashi), Contractible triples in highly connected graphs

[26] S.Fujita, (with X. Chen, M. Furuya, S. Young), Constructing connected bicritical graphs with edge-connectivity 2,

[27] S.Fujita, The generalized Ramsey numbers concerning three disjoint cycles and complete graphs,

[28] S.Fujita (with K. Kawarabayashi), Non-separating subgraphs in highly connected graphs,

[29] S.Fujita (with K. Kawarabayashi), Non-separating even cycles in highly connected graphs,

[30] S.Fujita (with K. Kawarabayashi), Contractible small subgraphs in k-connected graphs,

[31] S.Fujita (with S. Chiba, Y, Gao, Z. Li), On a sharp degree sum condition for disjoint chorded cycles in graphs,

[32] S.Fujita (with C. Magnant), Independence number and disjoint theta graphs,

[33] S.Fujita (with C. Magnant), Note on highly connected monochromatic subgraphs in 2-colored complete graphs,

[34] S.Fujita (with J. Fujisawa, M. Plummer, A. Saito, I. Schiermeyer), A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity,

[35] S.Fujita (with C. Magnant), Gallai-ramsey numbers for cycles,

[36] S.Fujita (with C. Magnant), Extensions of Gallai-Ramsey results,

[37] S.Fujita (with S. Chiba, K. Kawarabayashi, T. Sakuma), Disjoint even cycles packing in large graphs,

[38] S.Fujita (with K. Ando, K. Kawarabayashi), Minimally contraction-critically 6-connected graphs,

[39] S.Fujita (with T. Nakamigawa, T. Sakuma), Colored pebble motion on graphs,

[40] S.Fujita (with C. Magnant, K. Ozeki), Rainbow generalizations of ramsey theory: A survey,

[41] S.Fujita (with C. Magnant), Properly colored paths and cycles,

[42] S.Fujita (with H. Liu), The balanced decomposition number and vertex-connectivity,

[43] S.Fujita (with V. Borozan, A. Gerek, C. Magnant, Y. Manoussakis, L. Montero, Z. Tuza), Proper connection of graphs,

[44] S.Fujita (with H. Liu), The balanced decomposition number of

[45] S.Fujita (with A. Gyarfas, C. Magnant, A. Seress), Disconnected colors in generalized Gallai colorings,

[46] S.Fujita (with M. Furuya, C. Magnant), k-Rainbow domatic numbers,

[47] S.Fujita (with M. Furuya, C. Magnant), General bound on rainbow domination numbers,

[48] S.Fujita (with A. Gerek, C. Magnant), Proper connection with many colors,

[49] S.Fujita (with M. Furuya), Rainbow domination numbers on graphs with given radius,

[50] S.Fujita, Some remarks on long monochromatic cycles in edge-colored complete graphs,

[51] S.Fujita (with K. Kawarabayashi), A connected subgraph maintaining high connectivity,

[52] S.Fujita (with H. Liu, C. Magnant), Rainbow k-connection in dense graphs,

[53] S.Fujita (with G. Chen, A. Gyarfas, J. Lehel, A. Toth), Around a biclique cover conjecture,

[54] S.Fujita (with L. Lesniak, A. Toth), Further remarks on long monochromatic cycles in edge-colored complete graphs,

[55] S.Fujita (with M. Furuya), Difference between 2-rainbow domination and Roman domination in graphs,

[56] S.Fujita (with S. Chiba), Covering vertices by specified number of disjoint cycles, edges and isolated vertices,

[57] S.Fujita (with T. Nakamigawa, T. Sakuma), Pebble exchange on graphs,

[58] S.Fujita (with M. Furuya, A. Gyarfas, A. Toth), Partition of graphs and hypergraphs into monochromatic connected parts,

[59] S.Fujita (with M. Furuya, K. Ozeki), Forbidden subgraphs generating almost the same sets,

[60] S.Fujita (with X. Chen), On diameter and inverse degree of chemical graphs,

[61] S.Fujita (with L. Lesniak), Revisit of Erdos-Gallai's theorem on the circumference of a graph,

If you would like to read some of my submitted papers in the above list, you can send an email to me.

My research interests:
Graph Theory, especially, extremal problems, Ramsey number, domination number, paths, cycles, matching, factors, and connectivity in graphs.