Jun Fujisawa

Orcid: 0000-0002-7588-2859

According to our database1, Jun Fujisawa authored at least 45 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Hamilton cycles passing through a matching in a bipartite graph with high degree sum.
Discret. Math., January, 2024

2023
Removal of subgraphs and perfect matchings in graphs on surfaces.
J. Graph Theory, 2023

Game chromatic number of strong product graphs.
Discret. Math., 2023

2021
Induced Nets and Hamiltonicity of Claw-Free Graphs.
Graphs Comb., 2021

Distance Matching Extension in Cubic Bipartite Graphs.
Graphs Comb., 2021

2020
Edge proximity and matching extension in projective planar graphs.
J. Graph Theory, 2020

Distance matching extension and local structure of graphs.
J. Graph Theory, 2020

Non-hamiltonian 1-tough triangulations with disjoint separating triangles.
Discret. Appl. Math., 2020

2019
Pairs and triples of forbidden subgraphs and the existence of a 2-factor.
J. Graph Theory, 2019

2018
The Matching Extendability of Optimal 1-Planar Graphs.
Graphs Comb., 2018

2017
Edge proximity and matching extension in punctured planar triangulations.
Discret. Math., 2017

Forbidden Pairs with a Common Graph Generating Almost the Same Sets.
Electron. J. Comb., 2017

2015
Edge Proximity Conditions for Extendability in Planar Triangulations.
J. Graph Theory, 2015

Perfect matchings avoiding prescribed edges in a star-free graph.
Discret. Math., 2015

Forbidden Triples Generating a Finite set of 3-Connected Graphs.
Electron. J. Comb., 2015

2014
Distance-Restricted Matching Extension in Triangulations of the Torus and the Klein Bottle.
Electron. J. Comb., 2014

2013
Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs.
J. Graph Theory, 2013

Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices.
J. Comb. Theory B, 2013

Forbidden subgraphs generating a finite set.
Discret. Math., 2013

2012
Maximal <i>K</i>3's and Hamiltonicity of 4-connected claw-free graphs.
J. Graph Theory, 2012

Long cycles in unbalanced bipartite graphs.
Discret. Math., 2012

A Pair of Forbidden Subgraphs and 2-Factors.
Comb. Probab. Comput., 2012

2011
The existence of a 2-factor in <i>K</i><sub>1, <i>n</i></sub>-free graphs with large connectivity and large edge-connectivity.
J. Graph Theory, 2011

Closure for spanning trees and distant area.
Discuss. Math. Graph Theory, 2011

Forbidden induced subgraphs for star-free graphs.
Discret. Math., 2011

A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity.
Comb., 2011

2010
Forbidden subgraphs and the existence of a 2-factor.
J. Graph Theory, 2010

Degree Bounded Spanning Trees.
Graphs Comb., 2010

2009
Weighted degrees and heavy cycles in weighted graphs.
Discret. Math., 2009

lambda-backbone colorings along pairwise disjoint stars and matchings.
Discret. Math., 2009

Fan-type theorem for a long path passing through a specified vertex.
Ars Comb., 2009

Two forbidden subgraphs and the existence of a 2-factor in graphs.
Australas. J Comb., 2009

2008
Cycles passing through <i>k</i> + 1 vertices in <i>k</i>-connected graphs.
J. Graph Theory, 2008

A degree sum condition for long cycles passing through a linear forest.
Discret. Math., 2008

Degree conditions on claws and modified claws for hamiltonicity of graphs.
Discret. Math., 2008

Forbidden subgraphs and the existence of paths and cycles passing through specified vertices.
Discret. Math., 2008

A note on the 2-domination number of a tree.
Australas. J Comb., 2008

2007
The upper bound of the number of cycles in a 2-factor of a line graph.
J. Graph Theory, 2007

Heavy fans, cycles and paths in weighted graphs of large connectivity.
Discret. Math., 2007

2006
Weighted Ramsey problem.
Australas. J Comb., 2006

2005
Heavy cycles passing through some specified vertices in weighted graphs.
J. Graph Theory, 2005

Claw Conditions for Heavy Cycles in Weighted Graphs.
Graphs Comb., 2005

Heavy cycles in weighted graphs.
Electron. Notes Discret. Math., 2005

Ore-type degree condition for heavy paths in weighted graphs.
Discret. Math., 2005

A sk type condition for heavy cycles in weighted graphs.
Ars Comb., 2005


  Loading...