default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShinya Fujita 0001
Person information
- affiliation: Yokohama City University, Yokohama, Japan
Other persons with the same name
- Shinya Fujita 0002
![[0000-0003-1638-7003]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-1638-7003")
— Tohoku University, Sendai, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j80]Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo:
Safe sets and in-dominating sets in digraphs. Discret. Appl. Math. 346: 215-227 (2024)- 2023
- [j79]Shuya Chiba, Yoshimi Egawa, Shinya Fujita:
Minimum Number of Edges Guaranteeing the Existence of a K1, t-Factor in a Graph. Graphs Comb. 39(2): 27 (2023) - 2021
- [j78]Shinya Fujita, Boram Park:
The optimal proper connection number of a graph with given independence number. Discret. Optim. 41: 100660 (2021) - [j77]Shinya Fujita, Boram Park, Tadashi Sakuma:
Stable structure on safe set problems in vertex-weighted graphs. Eur. J. Comb. 91: 103211 (2021) - [j76]Shinya Fujita, Sergey Kitaev, Shizuka Sato, Li-Da Tong:
On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph. Order 38(3): 515-525 (2021) - 2020
- [j75]Shinya Fujita:
Optimal proper connection of graphs. Optim. Lett. 14(6): 1371-1380 (2020) - [c2]Shinya Fujita, Boram Park, Tadashi Sakuma:
Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-. WG 2020: 364-375
2010 – 2019
- 2019
- [j74]Shinya Fujita, Ruonan Li, Guanghui Wang:
Decomposing edge-coloured graphs under colour degree constraints. Comb. Probab. Comput. 28(5): 755-767 (2019) - [j73]Shinya Fujita, Michitaka Furuya, Colton Magnant:
General upper bounds on independent k-rainbow domination. Discret. Appl. Math. 258: 105-113 (2019) - [j72]Shinya Fujita, Bo Ning, Chuandong Xu, Shenggui Zhang:
On sufficient conditions for rainbow cycles in edge-colored graphs. Discret. Math. 342(7): 1956-1965 (2019) - [j71]Shinya Fujita, Tommy Jensen, Boram Park, Tadashi Sakuma:
On the weighted safe set problem on paths and cycles. J. Comb. Optim. 37(2): 685-701 (2019) - [i1]Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Anders Yeo:
Safe sets in digraphs. CoRR abs/1908.06664 (2019) - 2018
- [j70]Shinya Fujita, Michitaka Furuya:
Safe number and integrity of graphs. Discret. Appl. Math. 247: 398-406 (2018) - [j69]Jan Ekstein, Shinya Fujita, Adam Kabela, Jakub Teska:
Bounding the distance among longest paths in a connected graph. Discret. Math. 341(4): 1155-1159 (2018) - [j68]Yandong Bai, Shinya Fujita, Shenggui Zhang:
Kernels by properly colored paths in arc-colored digraphs. Discret. Math. 341(6): 1523-1533 (2018) - [j67]Shinya Fujita, Henry Liu, Amites Sarkar:
Highly connected subgraphs of graphs with given independence number. Eur. J. Comb. 70: 212-231 (2018) - [j66]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:
Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. 36(4): 1221-1242 (2018) - [j65]Shinya Fujita, Ruonan Li, Shenggui Zhang:
Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs. J. Graph Theory 87(3): 362-373 (2018) - [j64]Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza:
Safe sets, network majority on weighted trees. Networks 71(1): 81-92 (2018) - 2017
- [j63]Suyun Jiang, Shuya Chiba, Shinya Fujita, Jin Yan:
Vertex-disjoint copies of K1, t in K1, r-free graphs. Discret. Math. 340(4): 649-654 (2017) - [j62]Shinya Fujita, Ruonan Li, Guanghui Wang:
Decomposing edge-colored graphs under color degree constraints. Electron. Notes Discret. Math. 61: 491-497 (2017) - 2016
- [j61]Shinya Fujita, Gary MacGillivray, Tadashi Sakuma:
Safe set problem on graphs. Discret. Appl. Math. 215: 106-111 (2016) - [j60]Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza:
Network Majority on Tree Topological Network. Electron. Notes Discret. Math. 54: 79-84 (2016) - [j59]Shinya Fujita, Henry Liu, Amites Sarkar:
Highly Connected Subgraphs of Graphs with Given Independence Number (Extended Abstract). Electron. Notes Discret. Math. 54: 103-108 (2016) - [j58]Shinya Fujita, Ken-ichi Kawarabayashi:
Non-separating subgraphs in highly connected graphs. J. Comb. Theory B 117: 1-21 (2016) - [j57]Valentin Borozan, Michael Ferrara, Shinya Fujita, Michitaka Furuya, Yannis Manoussakis, Narayanan Narayanan, Derrick Stolee:
Partitioning a Graph into Highly Connected Subgraphs. J. Graph Theory 82(3): 322-333 (2016) - [c1]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe Sets in Graphs: Graph Classes and Structural Parameters. COCOA 2016: 241-253 - 2015
- [j56]Valentin Borozan, Gerard Jennhwa Chang, Nathann Cohen, Shinya Fujita, Narayanan Narayanan, Reza Naserasr, Petru Valicov:
From Edge-Coloring to Strong Edge-Coloring. Electron. J. Comb. 22(2): 2 (2015) - [j55]Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma:
Pebble exchange on graphs. Discret. Appl. Math. 184: 139-145 (2015) - [j54]Shinya Fujita, Michitaka Furuya, Colton Magnant:
General Bounds on Rainbow Domination Numbers. Graphs Comb. 31(3): 601-613 (2015) - [j53]Xue-Gang Chen, Shinya Fujita:
Downhill domination problem in graphs. Inf. Process. Lett. 115(6-8): 580-581 (2015) - 2014
- [j52]Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma:
Minimum degree conditions for vertex-disjoint even cycles in large graphs. Adv. Appl. Math. 54: 105-120 (2014) - [j51]Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth:
A Note on Covering Edge Colored Hypergraphs by Monochromatic Components. Electron. J. Comb. 21(2): 2 (2014) - [j50]Shinya Fujita, Michitaka Furuya:
Rainbow domination numbers on graphs with given radius. Discret. Appl. Math. 166: 115-122 (2014) - [j49]Shinya Fujita, Ken-ichi Kawarabayashi:
A connected subgraph maintaining high connectivity. Eur. J. Comb. 35: 245-255 (2014) - 2013
- [j48]Shinya Fujita, Michitaka Furuya, Kenta Ozeki:
Forbidden Subgraphs Generating Almost the Same Sets. Comb. Probab. Comput. 22(5): 733-748 (2013) - [j47]Shinya Fujita, Michitaka Furuya:
Difference between 2-rainbow domination and Roman domination in graphs. Discret. Appl. Math. 161(6): 806-812 (2013) - [j46]Shuya Chiba, Shinya Fujita:
Covering vertices by a specified number of disjoint cycles, edges and isolated vertices. Discret. Math. 313(3): 269-277 (2013) - [j45]Shinya Fujita, Henry Liu:
The balanced decomposition number of TK4 and series -parallel graphs. Discuss. Math. Graph Theory 33(2): 347-359 (2013) - [j44]Shinya Fujita, Linda M. Lesniak:
Revisit of Erdős-Gallai's theorem on the circumference of a graph. Inf. Process. Lett. 113(17): 646-648 (2013) - [j43]Shinya Fujita, András Gyárfás, Colton Magnant, Ákos Seress:
Disconnected Colors in Generalized Gallai-Colorings. J. Graph Theory 74(1): 104-114 (2013) - [j42]Shinya Fujita, Colton Magnant:
Forbidden Rainbow Subgraphs That Force Large Highly Connected Monochromatic Subgraphs. SIAM J. Discret. Math. 27(3): 1625-1637 (2013) - 2012
- [j41]Shinya Fujita:
Generalized Ramsey Numbers for Graphs with Three Disjoint Cycles Versus a Complete Graph. Electron. J. Comb. 19(2): 14 (2012) - [j40]Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth:
Partition of Graphs and Hypergraphs into Monochromatic Connected Parts. Electron. J. Comb. 19(3): 27 (2012) - [j39]Xue-Gang Chen, Shinya Fujita, Michitaka Furuya, Moo Young Sohn:
Constructing connected bicritical graphs with edge-connectivity 2. Discret. Appl. Math. 160(4-5): 488-493 (2012) - [j38]Shinya Fujita, Michitaka Furuya, Colton Magnant:
k-Rainbow domatic numbers. Discret. Appl. Math. 160(7-8): 1104-1113 (2012) - [j37]Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi:
Minimally contraction-critically 6-connected graphs. Discret. Math. 312(3): 671-679 (2012) - [j36]Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro Montero, Zsolt Tuza:
Proper connection of graphs. Discret. Math. 312(17): 2550-2560 (2012) - [j35]Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma:
Colored pebble motion on graphs. Eur. J. Comb. 33(5): 884-892 (2012) - [j34]Shinya Fujita, Colton Magnant:
Extensions of Gallai-Ramsey results. J. Graph Theory 70(4): 404-426 (2012) - 2011
- [j33]Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer:
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. Comb. 31(6): 703-723 (2011) - [j32]Shinya Fujita, Alexander Halperin, Colton Magnant:
Long Path Lemma concerning Connectivity and Independence Number. Electron. J. Comb. 18(1) (2011) - [j31]Shinya Fujita, Colton Magnant:
Note on Highly Connected Monochromatic Subgraphs in 2-Colored Complete Graphs. Electron. J. Comb. 18(1) (2011) - [j30]Shinya Fujita, Colton Magnant:
Independence Number and Disjoint Theta Graphs. Electron. J. Comb. 18(1) (2011) - [j29]Shinya Fujita, Colton Magnant:
Properly colored paths and cycles. Discret. Appl. Math. 159(14): 1391-1397 (2011) - [j28]Shinya Fujita:
Some remarks on long monochromatic cycles in edge-colored complete graphs. Discret. Math. 311(8-9): 688-689 (2011) - [j27]Shinya Fujita, Colton Magnant:
Gallai-Ramsey numbers for cycles. Discret. Math. 311(13): 1247-1254 (2011) - [j26]Shinya Fujita, Ken-ichi Kawarabayashi:
High connectivity keeping connected subgraph. Electron. Notes Discret. Math. 38: 355-360 (2011) - [j25]Shinya Fujita, Henry Liu, Colton Magnant:
Rainbow k-connection in Dense Graphs (Extended Abstract). Electron. Notes Discret. Math. 38: 361-366 (2011) - 2010
- [j24]Shinya Fujita, Ken-ichi Kawarabayashi:
Non-separating even cycles in highly connected graphs. Comb. 30(5): 565-580 (2010) - [j23]Shinya Fujita, Colton Magnant, Kenta Ozeki:
Rainbow Generalizations of Ramsey Theory: A Survey. Graphs Comb. 26(1): 1-30 (2010) - [j22]Shuya Chiba, Shinya Fujita, Yunshu Gao, Guojun Li:
On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs. Graphs Comb. 26(2): 173-186 (2010) - [j21]Shinya Fujita, Ken-ichi Kawarabayashi:
Contractible Small Subgraphs in k-connected Graphs. Graphs Comb. 26(4): 499-511 (2010) - [j20]Shinya Fujita, Henry Liu:
The Balanced Decomposition Number and Vertex Connectivity. SIAM J. Discret. Math. 24(4): 1597-1616 (2010)
2000 – 2009
- 2009
- [j19]Shinya Fujita, Atsushi Kaneko, Ingo Schiermeyer, Kazuhiro Suzuki:
A Rainbow k-Matching in the Complete Graph with r Colors. Electron. J. Comb. 16(1) (2009) - [j18]Shinya Fujita, Ken-ichi Kawarabayashi:
Note on non-separating and removable cycles in highly connected graphs. Discret. Appl. Math. 157(2): 398-399 (2009) - [j17]Shinya Fujita:
Degree conditions for the partition of a graph into cycles, edges and isolated vertices. Discret. Math. 309(11): 3534-3540 (2009) - [j16]Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma:
Disjoint Even Cycles Packing. Electron. Notes Discret. Math. 34: 113-119 (2009) - [j15]Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma:
Colored Pebble Motion on Graphs (Extended Abstract). Electron. Notes Discret. Math. 34: 185-189 (2009) - 2008
- [j14]Shinya Fujita, Tomoki Nakamigawa:
Balanced decomposition of a vertex-colored graph. Discret. Appl. Math. 156(18): 3339-3344 (2008) - [j13]Shinya Fujita:
Vertex-disjoint copies of K1+(K1 v K2) in claw-free graphs. Discret. Math. 308(9): 1628-1633 (2008) - [j12]Yoshimi Egawa, Shinya Fujita, Katsuhiro Ota:
K1, 3-factors in graphs. Discret. Math. 308(24): 5965-5973 (2008) - [j11]Shinya Fujita, Ken-ichi Kawarabayashi:
Connectivity keeping edges in graphs with large minimum degree. J. Comb. Theory B 98(4): 805-811 (2008) - [j10]Shinya Fujita, Ken-ichi Kawarabayashi:
Contractible elements in k-connected graphs not containing some specified graphs. J. Graph Theory 58(2): 97-109 (2008) - 2007
- [j9]Shinya Fujita, Akira Saito, Tomoki Yamashita:
Edge-dominating cycles in graphs. Discret. Math. 307(23): 2934-2942 (2007) - 2006
- [j8]Shinya Fujita, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita:
Degree sum conditions and vertex-disjoint cycles in a graph. Australas. J Comb. 35: 237-252 (2006) - [j7]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 B 96(3): 315-324 (2006) - 2005
- [j6]Shinya Fujita:
Vertex-disjoint copies of K4- in graphs. Australas. J Comb. 31: 189-200 (2005) - [j5]Shinya Fujita:
Partition of a graph into cycles and isolated vertices. Australas. J Comb. 32: 79-90 (2005) - [j4]Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang:
Existence of two disjoint long cycles in graphs. Discret. Math. 305(1-3): 154-169 (2005) - [j3]Shinya Fujita:
On graphs G for which both G and 'G are claw-free. Discuss. Math. Graph Theory 25(3): 267-272 (2005) - [j2]Shinya Fujita:
Recent Results on Disjoint Cycles in Graphs. Electron. Notes Discret. Math. 22: 409-412 (2005) - 2002
- [j1]Shinya Fujita:
Vertex-Disjoint K1, t's in Graphs. Ars Comb. 64: 211- (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
