Kiyoshi Yoshimoto

According to our database1, Kiyoshi Yoshimoto authored at least 47 papers between 1999 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
A panconnectivity theorem for bipartite graphs.
Discrete Mathematics, 2018

Pairs of forbidden subgraphs and 2-connected supereulerian graphs.
Discrete Mathematics, 2018

2017
On Dominating Even Subgraphs in Cubic Graphs.
SIAM J. Discrete Math., 2017

2016
Vertex Coloring of Graphs by Total 2-Weightings.
Graphs and Combinatorics, 2016

Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs.
Graphs and Combinatorics, 2016

Rainbow cycles in edge-colored graphs.
Discrete Mathematics, 2016

Locating sets of vertices on Hamiltonian cycles.
Discrete Applied Mathematics, 2016

2015
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture.
SIAM J. Discrete Math., 2015

Equivalence of Jackson's and Thomassen's conjectures.
J. Comb. Theory, Ser. B, 2015

2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths.
Graphs and Combinatorics, 2015

2-factors with bounded number of components in claw-free graphs.
Discrete Mathematics, 2015

2014
Note on Locating Pairs of Vertices on Hamiltonian Cycles.
Graphs and Combinatorics, 2014

An Extremal Problem Resulting in Many Paths.
Ars Comb., 2014

2013
4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski.
SIAM J. Discrete Math., 2013

2012
Claw-free graphs and 2-factors that separate independent vertices.
Journal of Graph Theory, 2012

2-factors and independent sets on claw-free graphs.
Discrete Mathematics, 2012

2011
2-factors in claw-free graphs.
Electronic Notes in Discrete Mathematics, 2011

2010
Closure concept for 2-factors in claw-free graphs.
Discrete Mathematics, 2010

Set-orderedness as a generalization of k-orderedness and cyclability.
Discrete Mathematics, 2010

A 2-factor in which each cycle contains a vertex in a specified stable set.
Australasian J. Combinatorics, 2010

2009
Spanning even subgraphs of 3-edge-connected graphs.
Journal of Graph Theory, 2009

Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs.
Graphs and Combinatorics, 2009

lambda-backbone colorings along pairwise disjoint stars and matchings.
Discrete Mathematics, 2009

2008
On a Spanning Tree with Specified Leaves.
Graphs and Combinatorics, 2008

Edge degrees and dominating cycles.
Discrete Mathematics, 2008

Relative length of longest paths and longest cycles in triangle-free graphs.
Discrete Mathematics, 2008

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

On components of 2-factors in claw-free graphs.
Electronic Notes in Discrete Mathematics, 2007

Cycles through specified vertices in triangle-free graphs.
Discussiones Mathematicae Graph Theory, 2007

On the number of components in 2-factors of claw-free graphs.
Discrete Mathematics, 2007

Even subgraphs of bridgeless graphs and 2-factors of line graphs.
Discrete Mathematics, 2007

Toughness and hamiltonicity in k-trees.
Discrete Mathematics, 2007

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

2003
A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition.
Journal of Graph Theory, 2003

2002
On a 2-factor with a specified edge in a graph satisfying the Ore condition.
Discrete Mathematics, 2002

On geometric independency trees for points in the plane.
Discrete Mathematics, 2002

On a hamiltonian cycle in which specified vertices are not isolated.
Discrete Mathematics, 2002

Contractible Edges and Bowties in a k-Connected Graph.
Ars Comb., 2002

2001
On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed.
J. Comb. Theory, Ser. B, 2001

The Connectivities of Trunk Graphs of Connected Graphs.
Ars Comb., 2001

Transformation of Spanning Trees in a 2-Connected Graph.
Ars Comb., 2001

2000
On spanning trees with restricted degrees.
Inf. Process. Lett., 2000

Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane.
Int. J. Comput. Geometry Appl., 2000

Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition.
Electronic Notes in Discrete Mathematics, 2000

A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition.
Electronic Notes in Discrete Mathematics, 2000

1999
The Connectivities of Leaf Graphs of 2-Connected Graphs.
J. Comb. Theory, Ser. B, 1999

Some results on geometric independency trees.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999


  Loading...