Shinya Fujita

87 papers B 1C 1Journal 85
YearRankTypeTitle / Venue / Authors
2026 J jnl
Bip-ordered bipartite Ramsey number.
Discret. Appl. Math.
Ayun Zhang, Baoleer, Shinya Fujita, Yaping Mao, Gang Yang
2026 J jnl
Classification of Graphs Via Vertex Cover and Domination Numbers.
Graphs Comb.
Robert D. Barish, Shinya Fujita, Farshad Kazemnejad, Behnaz Pahlousay
2026 J jnl
Sufficient conditions for edge-colored bipartite graphs to have rainbow and properly colored spanning trees.
Discret. Math.
Shinya Fujita, Mikio Kano, Shun-ichi Maezawa, Masao Tsugaki, Kiyoshi Yoshimoto
2025 J jnl
Connectivity keeping paths containing prescribed vertices in highly connected triangle-free graphs.
J. Comb. Theory B
Shinya Fujita
2024 J jnl
Safe sets and in-dominating sets in digraphs.
Discret. Appl. Math.
Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo
2023 J jnl
Minimum Number of Edges Guaranteeing the Existence of a K
Graphs Comb.
Shuya Chiba, Yoshimi Egawa, Shinya Fujita
2021 J jnl
On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph.
Order
Shinya Fujita, Sergey Kitaev, Shizuka Sato, Li-Da Tong
2021 J jnl
Stable structure on safe set problems in vertex-weighted graphs.
Eur. J. Comb.
Shinya Fujita, Boram Park, Tadashi Sakuma
2021 J jnl
The optimal proper connection number of a graph with given independence number.
Discret. Optim.
Shinya Fujita, Boram Park
2020 J jnl
Optimal proper connection of graphs.
Optim. Lett.
Shinya Fujita
2020 B conf
Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-.
WG
Shinya Fujita, Boram Park, Tadashi Sakuma
2019 J jnl
Decomposing edge-coloured graphs under colour degree constraints.
Comb. Probab. Comput.
Shinya Fujita, Ruonan Li, Guanghui Wang
2019 J jnl
General upper bounds on independent k-rainbow domination.
Discret. Appl. Math.
Shinya Fujita, Michitaka Furuya, Colton Magnant
2019 J jnl
On sufficient conditions for rainbow cycles in edge-colored graphs.
Discret. Math.
Shinya Fujita, Bo Ning, Chuandong Xu, Shenggui Zhang
2019 J jnl
On the weighted safe set problem on paths and cycles.
J. Comb. Optim.
Shinya Fujita, Tommy Jensen, Boram Park, Tadashi Sakuma
2019 J jnl
Safe sets in digraphs.
CoRR
Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Anders Yeo
2018 J jnl
Bounding the distance among longest paths in a connected graph.
Discret. Math.
Jan Ekstein, Shinya Fujita, Adam Kabela, Jakub Teska
2018 J jnl
Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs.
J. Graph Theory
Shinya Fujita, Ruonan Li, Shenggui Zhang
2018 J jnl
Highly connected subgraphs of graphs with given independence number.
Eur. J. Comb.
Shinya Fujita, Henry Liu, Amites Sarkar
2018 J jnl
Kernels by properly colored paths in arc-colored digraphs.
Discret. Math.
Yandong Bai, Shinya Fujita, Shenggui Zhang
2018 J jnl
Safe number and integrity of graphs.
Discret. Appl. Math.
Shinya Fujita, Michitaka Furuya
2018 J jnl
Safe sets in graphs: Graph classes and structural parameters.
J. Comb. Optim.
Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
2018 J jnl
Safe sets, network majority on weighted trees.
Networks
Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza
2017 J jnl
Decomposing edge-colored graphs under color degree constraints.
Electron. Notes Discret. Math.
Shinya Fujita, Ruonan Li, Guanghui Wang
2017 J jnl
Vertex-disjoint copies of K
Discret. Math.
Suyun Jiang, Shuya Chiba, Shinya Fujita, Jin Yan
2016 J jnl
Highly Connected Subgraphs of Graphs with Given Independence Number (Extended Abstract).
Electron. Notes Discret. Math.
Shinya Fujita, Henry Liu, Amites Sarkar
2016 J jnl
Network Majority on Tree Topological Network.
Electron. Notes Discret. Math.
Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza
2016 J jnl
Non-separating subgraphs in highly connected graphs.
J. Comb. Theory B
Shinya Fujita, Ken-ichi Kawarabayashi
2016 J jnl
Partitioning a Graph into Highly Connected Subgraphs.
J. Graph Theory
Valentin Borozan, Michael Ferrara, Shinya Fujita, Michitaka Furuya, Yannis Manoussakis, Narayanan Narayanan, Derrick Stolee
2016 C conf
Safe Sets in Graphs: Graph Classes and Structural Parameters.
COCOA
Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
2016 J jnl
Safe set problem on graphs.
Discret. Appl. Math.
Shinya Fujita, Gary MacGillivray, Tadashi Sakuma
2015 J jnl
Downhill domination problem in graphs.
Inf. Process. Lett.
Xue-Gang Chen, Shinya Fujita
2015 J jnl
From Edge-Coloring to Strong Edge-Coloring.
Electron. J. Comb.
Valentin Borozan, Gerard Jennhwa Chang, Nathann Cohen, Shinya Fujita, Narayanan Narayanan, Reza Naserasr, Petru Valicov
2015 J jnl
General Bounds on Rainbow Domination Numbers.
Graphs Comb.
Shinya Fujita, Michitaka Furuya, Colton Magnant
2015 J jnl
Pebble exchange on graphs.
Discret. Appl. Math.
Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
2014 J jnl
A Note on Covering Edge Colored Hypergraphs by Monochromatic Components.
Electron. J. Comb.
Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth
2014 J jnl
A connected subgraph maintaining high connectivity.
Eur. J. Comb.
Shinya Fujita, Ken-ichi Kawarabayashi
2014 J jnl
Minimum degree conditions for vertex-disjoint even cycles in large graphs.
Adv. Appl. Math.
Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma
2014 J jnl
Rainbow domination numbers on graphs with given radius.
Discret. Appl. Math.
Shinya Fujita, Michitaka Furuya
2013 J jnl
Covering vertices by a specified number of disjoint cycles, edges and isolated vertices.
Discret. Math.
Shuya Chiba, Shinya Fujita
2013 J jnl
Difference between 2-rainbow domination and Roman domination in graphs.
Discret. Appl. Math.
Shinya Fujita, Michitaka Furuya
2013 J jnl
Disconnected Colors in Generalized Gallai-Colorings.
J. Graph Theory
Shinya Fujita, András Gyárfás, Colton Magnant, Ákos Seress
2013 J jnl
Forbidden Rainbow Subgraphs That Force Large Highly Connected Monochromatic Subgraphs.
SIAM J. Discret. Math.
Shinya Fujita, Colton Magnant
2013 J jnl
Forbidden Subgraphs Generating Almost the Same Sets.
Comb. Probab. Comput.
Shinya Fujita, Michitaka Furuya, Kenta Ozeki
2013 J jnl
Revisit of Erdős-Gallai's theorem on the circumference of a graph.
Inf. Process. Lett.
Shinya Fujita, Linda M. Lesniak
2013 J jnl
The balanced decomposition number of
Discuss. Math. Graph Theory
Shinya Fujita, Henry Liu
2012 J jnl
Colored pebble motion on graphs.
Eur. J. Comb.
Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
2012 J jnl
Constructing connected bicritical graphs with edge-connectivity 2.
Discret. Appl. Math.
Xue-Gang Chen, Shinya Fujita, Michitaka Furuya, Moo Young Sohn
2012 J jnl
Extensions of Gallai-Ramsey results.
J. Graph Theory
Shinya Fujita, Colton Magnant
2012 J jnl
Generalized Ramsey Numbers for Graphs with Three Disjoint Cycles Versus a Complete Graph.
Electron. J. Comb.
Shinya Fujita
2012 J jnl
Minimally contraction-critically 6-connected graphs.
Discret. Math.
Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi
2012 J jnl
Partition of Graphs and Hypergraphs into Monochromatic Connected Parts.
Electron. J. Comb.
Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth
2012 J jnl
Proper connection of graphs.
Discret. Math.
Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro Montero, Zsolt Tuza
2012 J jnl
k-Rainbow domatic numbers.
Discret. Appl. Math.
Shinya Fujita, Michitaka Furuya, Colton Magnant
2011 J jnl
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity.
Comb.
Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer
2011 J jnl
Gallai-Ramsey numbers for cycles.
Discret. Math.
Shinya Fujita, Colton Magnant
2011 J jnl
High connectivity keeping connected subgraph.
Electron. Notes Discret. Math.
Shinya Fujita, Ken-ichi Kawarabayashi
2011 J jnl
Independence Number and Disjoint Theta Graphs.
Electron. J. Comb.
Shinya Fujita, Colton Magnant
2011 J jnl
Long Path Lemma concerning Connectivity and Independence Number.
Electron. J. Comb.
Shinya Fujita, Alexander Halperin, Colton Magnant
2011 J jnl
Note on Highly Connected Monochromatic Subgraphs in 2-Colored Complete Graphs.
Electron. J. Comb.
Shinya Fujita, Colton Magnant
2011 J jnl
Properly colored paths and cycles.
Discret. Appl. Math.
Shinya Fujita, Colton Magnant
2011 J jnl
Rainbow k-connection in Dense Graphs (Extended Abstract).
Electron. Notes Discret. Math.
Shinya Fujita, Henry Liu, Colton Magnant
2011 J jnl
Some remarks on long monochromatic cycles in edge-colored complete graphs.
Discret. Math.
Shinya Fujita
2010 J jnl
Contractible Small Subgraphs in
Graphs Comb.
Shinya Fujita, Ken-ichi Kawarabayashi
2010 J jnl
Non-separating even cycles in highly connected graphs.
Comb.
Shinya Fujita, Ken-ichi Kawarabayashi
2010 J jnl
On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs.
Graphs Comb.
Shuya Chiba, Shinya Fujita, Yunshu Gao, Guojun Li
2010 J jnl
Rainbow Generalizations of Ramsey Theory: A Survey.
Graphs Comb.
Shinya Fujita, Colton Magnant, Kenta Ozeki
2010 J jnl
The Balanced Decomposition Number and Vertex Connectivity.
SIAM J. Discret. Math.
Shinya Fujita, Henry Liu
2009 J jnl
A Rainbow k-Matching in the Complete Graph with r Colors.
Electron. J. Comb.
Shinya Fujita, Atsushi Kaneko, Ingo Schiermeyer, Kazuhiro Suzuki
2009 J jnl
Colored Pebble Motion on Graphs (Extended Abstract).
Electron. Notes Discret. Math.
Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
2009 J jnl
Degree conditions for the partition of a graph into cycles, edges and isolated vertices.
Discret. Math.
Shinya Fujita
2009 J jnl
Disjoint Even Cycles Packing.
Electron. Notes Discret. Math.
Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma
2009 J jnl
Note on non-separating and removable cycles in highly connected graphs.
Discret. Appl. Math.
Shinya Fujita, Ken-ichi Kawarabayashi
2008 J jnl
Balanced decomposition of a vertex-colored graph.
Discret. Appl. Math.
Shinya Fujita, Tomoki Nakamigawa
2008 J jnl
Connectivity keeping edges in graphs with large minimum degree.
J. Comb. Theory B
Shinya Fujita, Ken-ichi Kawarabayashi
2008 J jnl
Contractible elements in
J. Graph Theory
Shinya Fujita, Ken-ichi Kawarabayashi
2008 J jnl
K
Discret. Math.
Yoshimi Egawa, Shinya Fujita, Katsuhiro Ota
2008 J jnl
Vertex-disjoint copies of K
Discret. Math.
Shinya Fujita
2007 J jnl
Edge-dominating cycles in graphs.
Discret. Math.
Shinya Fujita, Akira Saito, Tomoki Yamashita
2006 J jnl
A pair of forbidden subgraphs and perfect matchings.
J. Comb. Theory B
Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito
2006 J jnl
Degree sum conditions and vertex-disjoint cycles in a graph.
Australas. J Comb.
Shinya Fujita, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita
2005 J jnl
Existence of two disjoint long cycles in graphs.
Discret. Math.
Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang
2005 J jnl
On graphs G for which both G and
Discuss. Math. Graph Theory
Shinya Fujita
2005 J jnl
Partition of a graph into cycles and isolated vertices.
Australas. J Comb.
Shinya Fujita
2005 J jnl
Recent Results on Disjoint Cycles in Graphs.
Electron. Notes Discret. Math.
Shinya Fujita
2005 J jnl
Vertex-disjoint copies of K
Australas. J Comb.
Shinya Fujita
2002 J jnl
Vertex-Disjoint K1, t's in Graphs.
Ars Comb.
Shinya Fujita