Vertex-Disjoint K1, t's in Graphs. - Shinya Fujita 001 (Ars Comb., 2002)

Vertex-disjoint copies of K4- in graphs. - Shinya Fujita 001 (Australas. J Comb., 2005)

Partition of a graph into cycles and isolated vertices. - Shinya Fujita 001 (Australas. J Comb., 2005)

Existence of two disjoint long cycles in graphs. - Yoshimi Egawa; Shinya Fujita 001; Ken-ichi Kawarabayashi; Hong Wang 005 (Discret. Math., 2005)

On graphs G for which both G and 'G are claw-free. - Shinya Fujita 001 (Discuss. Math. Graph Theory, 2005)

Recent Results on Disjoint Cycles in Graphs. - Shinya Fujita 001 (Electron. Notes Discret. Math., 2005)

Degree sum conditions and vertex-disjoint cycles in a graph. - Shinya Fujita 001; Hajime Matsumura; Masao Tsugaki; Tomoki Yamashita (Australas. J Comb., 2006)

A pair of forbidden subgraphs and perfect matchings. - Shinya Fujita 001; Ken-ichi Kawarabayashi; Cláudio Leonardo Lucchesi; Katsuhiro Ota; Michael D. Plummer; Akira Saito (J. Comb. Theory B, 2006)

Edge-dominating cycles in graphs. - Shinya Fujita 001; Akira Saito; Tomoki Yamashita (Discret. Math., 2007)

Balanced decomposition of a vertex-colored graph. - Shinya Fujita 001; Tomoki Nakamigawa (Discret. Appl. Math., 2008)

K1, 3-factors in graphs. - Yoshimi Egawa; Shinya Fujita 001; Katsuhiro Ota (Discret. Math., 2008)

Vertex-disjoint copies of K1+(K1 v K2) in claw-free graphs. - Shinya Fujita 001 (Discret. Math., 2008)

Connectivity keeping edges in graphs with large minimum degree. - Shinya Fujita 001; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2008)

Contractible elements in k-connected graphs not containing some specified graphs. - Shinya Fujita 001; Ken-ichi Kawarabayashi (J. Graph Theory, 2008)

A Rainbow k-Matching in the Complete Graph with r Colors. - Shinya Fujita 001; Atsushi Kaneko; Ingo Schiermeyer; Kazuhiro Suzuki (Electron. J. Comb., 2009)

Note on non-separating and removable cycles in highly connected graphs. - Shinya Fujita 001; Ken-ichi Kawarabayashi (Discret. Appl. Math., 2009)

Degree conditions for the partition of a graph into cycles, edges and isolated vertices. - Shinya Fujita 001 (Discret. Math., 2009)

Disjoint Even Cycles Packing. - Shuya Chiba; Shinya Fujita 001; Ken-ichi Kawarabayashi; Tadashi Sakuma (Electron. Notes Discret. Math., 2009)

Colored Pebble Motion on Graphs (Extended Abstract). - Shinya Fujita 001; Tomoki Nakamigawa; Tadashi Sakuma (Electron. Notes Discret. Math., 2009)

Non-separating even cycles in highly connected graphs. - Shinya Fujita 001; Ken-ichi Kawarabayashi (Comb., 2010)

On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs. - Shuya Chiba; Shinya Fujita 001; Yunshu Gao; Guojun Li (Graphs Comb., 2010)

Contractible Small Subgraphs in k-connected Graphs. - Shinya Fujita 001; Ken-ichi Kawarabayashi (Graphs Comb., 2010)

Rainbow Generalizations of Ramsey Theory: A Survey. - Shinya Fujita 001; Colton Magnant; Kenta Ozeki (Graphs Comb., 2010)

The Balanced Decomposition Number and Vertex Connectivity. - Shinya Fujita 001; Henry Liu (SIAM J. Discret. Math., 2010)

A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. - Jun Fujisawa; Shinya Fujita 001; Michael D. Plummer; Akira Saito; Ingo Schiermeyer (Comb., 2011)

Long Path Lemma concerning Connectivity and Independence Number. - Shinya Fujita 001; Alexander Halperin; Colton Magnant (Electron. J. Comb., 2011)

Note on Highly Connected Monochromatic Subgraphs in 2-Colored Complete Graphs. - Shinya Fujita 001; Colton Magnant (Electron. J. Comb., 2011)

Independence Number and Disjoint Theta Graphs. - Shinya Fujita 001; Colton Magnant (Electron. J. Comb., 2011)

Properly colored paths and cycles. - Shinya Fujita 001; Colton Magnant (Discret. Appl. Math., 2011)

Some remarks on long monochromatic cycles in edge-colored complete graphs. - Shinya Fujita 001 (Discret. Math., 2011)

Gallai-Ramsey numbers for cycles. - Shinya Fujita 001; Colton Magnant (Discret. Math., 2011)

High connectivity keeping connected subgraph. - Shinya Fujita 001; Ken-ichi Kawarabayashi (Electron. Notes Discret. Math., 2011)

Rainbow k-connection in Dense Graphs (Extended Abstract). - Shinya Fujita 001; Henry Liu; Colton Magnant (Electron. Notes Discret. Math., 2011)

Generalized Ramsey Numbers for Graphs with Three Disjoint Cycles Versus a Complete Graph. - Shinya Fujita 001 (Electron. J. Comb., 2012)

Partition of Graphs and Hypergraphs into Monochromatic Connected Parts. - Shinya Fujita 001; Michitaka Furuya; András Gyárfás; Ágnes Tóth (Electron. J. Comb., 2012)

Constructing connected bicritical graphs with edge-connectivity 2. - Xue-Gang Chen; Shinya Fujita 001; Michitaka Furuya; Moo Young Sohn (Discret. Appl. Math., 2012)

k-Rainbow domatic numbers. - Shinya Fujita 001; Michitaka Furuya; Colton Magnant (Discret. Appl. Math., 2012)

Minimally contraction-critically 6-connected graphs. - Kiyoshi Ando; Shinya Fujita 001; Ken-ichi Kawarabayashi (Discret. Math., 2012)

Proper connection of graphs. - Valentin Borozan; Shinya Fujita 001; Aydin Gerek; Colton Magnant; Yannis Manoussakis; Leandro Montero; Zsolt Tuza (Discret. Math., 2012)

Colored pebble motion on graphs. - Shinya Fujita 001; Tomoki Nakamigawa; Tadashi Sakuma (Eur. J. Comb., 2012)

Extensions of Gallai-Ramsey results. - Shinya Fujita 001; Colton Magnant (J. Graph Theory, 2012)

Forbidden Subgraphs Generating Almost the Same Sets. - Shinya Fujita 001; Michitaka Furuya; Kenta Ozeki (Comb. Probab. Comput., 2013)

Difference between 2-rainbow domination and Roman domination in graphs. - Shinya Fujita 001; Michitaka Furuya (Discret. Appl. Math., 2013)

Covering vertices by a specified number of disjoint cycles, edges and isolated vertices. - Shuya Chiba; Shinya Fujita 001 (Discret. Math., 2013)

The balanced decomposition number of TK4 and series -parallel graphs. - Shinya Fujita 001; Henry Liu (Discuss. Math. Graph Theory, 2013)

Revisit of Erdős-Gallai's theorem on the circumference of a graph. - Shinya Fujita 001; Linda M. Lesniak (Inf. Process. Lett., 2013)

Disconnected Colors in Generalized Gallai-Colorings. - Shinya Fujita 001; András Gyárfás; Colton Magnant; Ákos Seress (J. Graph Theory, 2013)

Forbidden Rainbow Subgraphs That Force Large Highly Connected Monochromatic Subgraphs. - Shinya Fujita 001; Colton Magnant (SIAM J. Discret. Math., 2013)

Minimum degree conditions for vertex-disjoint even cycles in large graphs. - Shuya Chiba; Shinya Fujita 001; Ken-ichi Kawarabayashi; Tadashi Sakuma (Adv. Appl. Math., 2014)

A Note on Covering Edge Colored Hypergraphs by Monochromatic Components. - Shinya Fujita 001; Michitaka Furuya; András Gyárfás; Ágnes Tóth (Electron. J. Comb., 2014)

Rainbow domination numbers on graphs with given radius. - Shinya Fujita 001; Michitaka Furuya (Discret. Appl. Math., 2014)

A connected subgraph maintaining high connectivity. - Shinya Fujita 001; Ken-ichi Kawarabayashi (Eur. J. Comb., 2014)

From Edge-Coloring to Strong Edge-Coloring. - Valentin Borozan; Gerard Jennhwa Chang; Nathann Cohen; Shinya Fujita 001; Narayanan Narayanan; Reza Naserasr; Petru Valicov (Electron. J. Comb., 2015)

Pebble exchange on graphs. - Shinya Fujita 001; Tomoki Nakamigawa; Tadashi Sakuma (Discret. Appl. Math., 2015)

General Bounds on Rainbow Domination Numbers. - Shinya Fujita 001; Michitaka Furuya; Colton Magnant (Graphs Comb., 2015)

Downhill domination problem in graphs. - Xue-Gang Chen; Shinya Fujita 001 (Inf. Process. Lett., 2015)

Safe Sets in Graphs: Graph Classes and Structural Parameters. - Raquel Águeda; Nathann Cohen; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Leandro Montero; Reza Naserasr; Yota Otachi; Tadashi Sakuma; Zsolt Tuza; Renyu Xu (COCOA, 2016)

Safe set problem on graphs. - Shinya Fujita 001; Gary MacGillivray; Tadashi Sakuma (Discret. Appl. Math., 2016)

Network Majority on Tree Topological Network. - Ravindra B. Bapat 001; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Tadashi Sakuma; Zsolt Tuza (Electron. Notes Discret. Math., 2016)

Highly Connected Subgraphs of Graphs with Given Independence Number (Extended Abstract). - Shinya Fujita 001; Henry Liu; Amites Sarkar (Electron. Notes Discret. Math., 2016)

Non-separating subgraphs in highly connected graphs. - Shinya Fujita 001; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2016)

Partitioning a Graph into Highly Connected Subgraphs. - Valentin Borozan; Michael Ferrara; Shinya Fujita 001; Michitaka Furuya; Yannis Manoussakis; Narayanan Narayanan; Derrick Stolee (J. Graph Theory, 2016)

Vertex-disjoint copies of K1, t in K1, r-free graphs. - Suyun Jiang; Shuya Chiba; Shinya Fujita 001; Jin Yan (Discret. Math., 2017)

Decomposing edge-colored graphs under color degree constraints. - Shinya Fujita 001; Ruonan Li; Guanghui Wang 002 (Electron. Notes Discret. Math., 2017)

Safe number and integrity of graphs. - Shinya Fujita 001; Michitaka Furuya (Discret. Appl. Math., 2018)

Kernels by properly colored paths in arc-colored digraphs. - Yandong Bai; Shinya Fujita 001; Shenggui Zhang (Discret. Math., 2018)

Bounding the distance among longest paths in a connected graph. - Jan Ekstein; Shinya Fujita 001; Adam Kabela; Jakub Teska (Discret. Math., 2018)

Highly connected subgraphs of graphs with given independence number. - Shinya Fujita 001; Henry Liu; Amites Sarkar (Eur. J. Comb., 2018)

Safe sets in graphs: Graph classes and structural parameters. - Raquel Águeda; Nathann Cohen; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Leandro Montero; Reza Naserasr; Hirotaka Ono 001; Yota Otachi; Tadashi Sakuma; Zsolt Tuza; et al. (J. Comb. Optim., 2018)

Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs. - Shinya Fujita 001; Ruonan Li; Shenggui Zhang (J. Graph Theory, 2018)

Safe sets, network majority on weighted trees. - Ravindra B. Bapat 001; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Tadashi Sakuma; Zsolt Tuza (Networks, 2018)

Safe sets in digraphs. - Yandong Bai; Jørgen Bang-Jensen; Shinya Fujita 001; Anders Yeo (CoRR, 2019)

Decomposing edge-coloured graphs under colour degree constraints. - Shinya Fujita 001; Ruonan Li; Guanghui Wang 002 (Comb. Probab. Comput., 2019)

General upper bounds on independent k-rainbow domination. - Shinya Fujita 001; Michitaka Furuya; Colton Magnant (Discret. Appl. Math., 2019)

On sufficient conditions for rainbow cycles in edge-colored graphs. - Shinya Fujita 001; Bo Ning 001; Chuandong Xu; Shenggui Zhang (Discret. Math., 2019)

On the weighted safe set problem on paths and cycles. - Shinya Fujita 001; Tommy Jensen; Boram Park; Tadashi Sakuma (J. Comb. Optim., 2019)

Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-. - Shinya Fujita 001; Boram Park; Tadashi Sakuma (WG, 2020)

Optimal proper connection of graphs. - Shinya Fujita 001 (Optim. Lett., 2020)

The optimal proper connection number of a graph with given independence number. - Shinya Fujita 001; Boram Park (Discret. Optim., 2021)

Stable structure on safe set problems in vertex-weighted graphs. - Shinya Fujita 001; Boram Park; Tadashi Sakuma (Eur. J. Comb., 2021)

On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph. - Shinya Fujita 001; Sergey Kitaev; Shizuka Sato; Li-Da Tong (Order, 2021)

Minimum Number of Edges Guaranteeing the Existence of a K1, t-Factor in a Graph. - Shuya Chiba; Yoshimi Egawa; Shinya Fujita 001 (Graphs Comb., 2023)

Safe sets and in-dominating sets in digraphs. - Yandong Bai; Jørgen Bang-Jensen; Shinya Fujita 001; Hirotaka Ono 001; Anders Yeo (Discret. Appl. Math., 2024)

Connectivity keeping paths containing prescribed vertices in highly connected triangle-free graphs. - Shinya Fujita 001 (J. Comb. Theory B, 2025)