default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun Fujisawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j45]Jun Fujisawa, Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima
:
Hamilton cycles passing through a matching in a bipartite graph with high degree sum. Discret. Math. 347(1): 113692 (2024)- 2023
- [j44]Hikoe Enomoto, Jun Fujisawa, Naoki Matsumoto:
Game chromatic number of strong product graphs. Discret. Math. 346(1): 113162 (2023) - [j43]Robert E. L. Aldred, Jun Fujisawa:
Removal of subgraphs and perfect matchings in graphs on surfaces. J. Graph Theory 102(2): 304-321 (2023) - 2021
- [j42]Shuya Chiba, Jun Fujisawa:
Induced Nets and Hamiltonicity of Claw-Free Graphs. Graphs Comb. 37(3): 663-690 (2021) - [j41]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Distance Matching Extension in Cubic Bipartite Graphs. Graphs Comb. 37(5): 1793-1806 (2021) - 2020
- [j40]Jun Fujisawa, Carol T. Zamfirescu:
Non-hamiltonian 1-tough triangulations with disjoint separating triangles. Discret. Appl. Math. 284: 622-625 (2020) - [j39]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Distance matching extension and local structure of graphs. J. Graph Theory 93(1): 5-20 (2020) - [j38]Jun Fujisawa, Hiroki Seno:
Edge proximity and matching extension in projective planar graphs. J. Graph Theory 95(3): 341-367 (2020)
2010 – 2019
- 2019
- [j37]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Pairs and triples of forbidden subgraphs and the existence of a 2-factor. J. Graph Theory 90(1): 61-82 (2019) - 2018
- [j36]Jun Fujisawa, Keita Segawa, Yusuke Suzuki:
The Matching Extendability of Optimal 1-Planar Graphs. Graphs Comb. 34(5): 1089-1099 (2018) - 2017
- [j35]Shuya Chiba, Jun Fujisawa, Michitaka Furuya, Hironobu Ikarashi:
Forbidden Pairs with a Common Graph Generating Almost the Same Sets. Electron. J. Comb. 24(2): 2 (2017) - [j34]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Edge proximity and matching extension in punctured planar triangulations. Discret. Math. 340(12): 2978-2985 (2017) - 2015
- [j33]Yoshimi Egawa, Jun Fujisawa, Michitaka Furuya, Michael D. Plummer, Akira Saito:
Forbidden Triples Generating a Finite set of 3-Connected Graphs. Electron. J. Comb. 22(3): 3 (2015) - [j32]Yoshimi Egawa, Jun Fujisawa, Michael D. Plummer, Akira Saito, Tomoki Yamashita:
Perfect matchings avoiding prescribed edges in a star-free graph. Discret. Math. 338(12): 2260-2274 (2015) - [j31]Jun Fujisawa, Katsuhiro Ota:
Edge Proximity Conditions for Extendability in Planar Triangulations. J. Graph Theory 80(1): 1-11 (2015) - 2014
- [j30]Robert E. L. Aldred, Jun Fujisawa:
Distance-Restricted Matching Extension in Triangulations of the Torus and the Klein Bottle. Electron. J. Comb. 21(3): 3 (2014) - 2013
- [j29]Jun Fujisawa, Michael D. Plummer, Akira Saito:
Forbidden subgraphs generating a finite set. Discret. Math. 313(19): 1835-1842 (2013) - [j28]Jun Fujisawa, Atsuhiro Nakamoto, Kenta Ozeki:
Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices. J. Comb. Theory B 103(1): 46-60 (2013) - [j27]Jun Fujisawa:
Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs. J. Graph Theory 73(2): 146-160 (2013) - 2012
- [j26]Jun Fujisawa, Akira Saito:
A Pair of Forbidden Subgraphs and 2-Factors. Comb. Probab. Comput. 21(1-2): 149-158 (2012) - [j25]Shuya Chiba, Jun Fujisawa, Masao Tsugaki, Tomoki Yamashita:
Long cycles in unbalanced bipartite graphs. Discret. Math. 312(11): 1857-1862 (2012) - [j24]Jun Fujisawa, Katsuhiro Ota:
Maximal K3's and Hamiltonicity of 4-connected claw-free graphs. J. Graph Theory 70(1): 40-53 (2012) - 2011
- [j23]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) - [j22]Jun Fujisawa, Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro:
Forbidden induced subgraphs for star-free graphs. Discret. Math. 311(21): 2475-2484 (2011) - [j21]Jun Fujisawa, Akira Saito, Ingo Schiermeyer:
Closure for spanning trees and distant area. Discuss. Math. Graph Theory 31(1): 143-159 (2011) - [j20]Robert E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito:
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity. J. Graph Theory 68(1): 77-89 (2011) - 2010
- [j19]Jun Fujisawa, Hajime Matsumura, Tomoki Yamashita:
Degree Bounded Spanning Trees. Graphs Comb. 26(5): 695-720 (2010) - [j18]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Forbidden subgraphs and the existence of a 2-factor. J. Graph Theory 64(3): 250-266 (2010)
2000 – 2009
- 2009
- [j17]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Two forbidden subgraphs and the existence of a 2-factor in graphs. Australas. J Comb. 44: 235-246 (2009) - [j16]Hikoe Enomoto, Jun Fujisawa:
Fan-type theorem for a long path passing through a specified vertex. Ars Comb. 90 (2009) - [j15]Haitze J. Broersma, Jun Fujisawa, Bert Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto:
lambda-backbone colorings along pairwise disjoint stars and matchings. Discret. Math. 309(18): 5596-5609 (2009) - [j14]Jun Fujisawa:
Weighted degrees and heavy cycles in weighted graphs. Discret. Math. 309(23-24): 6483-6495 (2009) - 2008
- [j13]Jun Fujisawa, Adriana Hansberg, Takahiro Kubo, Akira Saito, Masahide Sugita, Lutz Volkmann:
A note on the 2-domination number of a tree. Australas. J Comb. 40: 265-268 (2008) - [j12]Jun Fujisawa, Tomoki Yamashita:
Degree conditions on claws and modified claws for hamiltonicity of graphs. Discret. Math. 308(9): 1612-1619 (2008) - [j11]Jun Fujisawa, Tomoki Yamashita:
A degree sum condition for long cycles passing through a linear forest. Discret. Math. 308(12): 2382-2388 (2008) - [j10]Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama, Masao Tsugaki:
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices. Discret. Math. 308(24): 6111-6114 (2008) - [j9]Jun Fujisawa, Tomoki Yamashita:
Cycles passing through k + 1 vertices in k-connected graphs. J. Graph Theory 58(2): 179-190 (2008) - 2007
- [j8]Jun Fujisawa:
Heavy fans, cycles and paths in weighted graphs of large connectivity. Discret. Math. 307(1): 38-53 (2007) - [j7]Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui Zhang:
The upper bound of the number of cycles in a 2-factor of a line graph. J. Graph Theory 55(1): 72-82 (2007) - 2006
- [j6]Jun Fujisawa, Katsuhiro Ota:
Weighted Ramsey problem. Australas. J Comb. 34: 331-342 (2006) - 2005
- [j5]Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota:
A sk type condition for heavy cycles in weighted graphs. Ars Comb. 76 (2005) - [j4]Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota:
Ore-type degree condition for heavy paths in weighted graphs. Discret. Math. 300(1-3): 100-109 (2005) - [j3]Jun Fujisawa:
Heavy cycles in weighted graphs. Electron. Notes Discret. Math. 22: 195-199 (2005) - [j2]Jun Fujisawa:
Claw Conditions for Heavy Cycles in Weighted Graphs. Graphs Comb. 21(2): 217-229 (2005) - [j1]Jun Fujisawa, Kiyoshi Yoshimoto, Shenggui Zhang:
Heavy cycles passing through some specified vertices in weighted graphs. J. Graph Theory 49(2): 93-103 (2005)
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-06-10 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:
