Kiyoshi Yoshimoto - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 50 from 50

2023

Disjoint properly colored cycles in edge-colored complete bipartite graphsKiyoshi Yoshimoto. DM, 346(1):113095, 2023. [doi]

On connectivities of edge-colored graphsKiyoshi Yoshimoto. DAM, 325:87-92, 2023. [doi]

2021

Edge-colored complete graphs without properly colored even cycles: A full characterizationRuonan Li, Hajo Broersma, Maho Yokota, Kiyoshi Yoshimoto. jgt, 98(1):110-124, 2021. [doi]

2020

A complete bipartite graph without properly colored cycles of length fourRoman Cada, Kenta Ozeki, Kiyoshi Yoshimoto. jgt, 93(2):168-180, 2020. [doi]

2018

Pairs of forbidden subgraphs and 2-connected supereulerian graphsRoman Cada, Kenta Ozeki, Liming Xiong, Kiyoshi Yoshimoto. DM, 341(6):1696-1707, 2018. [doi]

A panconnectivity theorem for bipartite graphsHui Du, Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto. DM, 341(1):151-154, 2018. [doi]

2017

On Dominating Even Subgraphs in Cubic GraphsRoman Cada, Shuya Chiba, Kenta Ozeki, Kiyoshi Yoshimoto. siamdm, 31(2):890-907, 2017. [doi]

2016

Rainbow cycles in edge-colored graphsRoman Cada, Atsushi Kaneko, Zdenek Ryjácek, Kiyoshi Yoshimoto. DM, 339(4):1387-1392, 2016. [doi]

Locating Pairs of Vertices on a Hamiltonian Cycle in BigraphsRalph J. Faudree, Jenö Lehel, Kiyoshi Yoshimoto. gc, 32(3):963-986, 2016. [doi]

Locating sets of vertices on Hamiltonian cyclesRalph J. Faudree, Hao Li, Kiyoshi Yoshimoto. DAM, 209:107-114, 2016. [doi]

Vertex Coloring of Graphs by Total 2-WeightingsJonathan Hulgan, Jeno Lehel, Kenta Ozeki, Kiyoshi Yoshimoto. gc, 32(6):2461-2471, 2016. [doi]

2015

2-Factors in Claw-Free Graphs with Lower Bounds Cycle LengthsRoman Cada, Shuya Chiba, Kiyoshi Yoshimoto. gc, 31(1):99-113, 2015. [doi]

Equivalence of Jackson's and Thomassen's conjecturesRoman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto. JCT, 114:124-147, 2015. [doi]

A Relationship Between Thomassen's Conjecture and Bondy's ConjectureRoman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto. siamdm, 29(1):26-35, 2015. [doi]

2-factors with bounded number of components in claw-free graphsKenta Ozeki, Zdenek Ryjácek, Kiyoshi Yoshimoto. DM, 338(5):793-808, 2015. [doi]

2014

Note on Locating Pairs of Vertices on Hamiltonian CyclesRalph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto. gc, 30(4):887-894, 2014. [doi]

An Extremal Problem Resulting in Many PathsRichard H. Schelp, Kiyoshi Yoshimoto. arscom, 116:23-32, 2014.

2013

4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and ŠkrekovskiRoman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto. siamdm, 27(1):141-144, 2013. [doi]

2012

Claw-free graphs and 2-factors that separate independent verticesRalph J. Faudree, Colton Magnant, Kenta Ozeki, Kiyoshi Yoshimoto. jgt, 69(3):251-263, 2012. [doi]

2-factors and independent sets on claw-free graphsRoman Kuzel, Kenta Ozeki, Kiyoshi Yoshimoto. DM, 312(2):202-206, 2012. [doi]

2011

2-factors in claw-free graphsRoman Cada, Shuya Chiba, Kiyoshi Yoshimoto. endm, 38:213-219, 2011. [doi]

2010

A 2-factor in which each cycle contains a vertex in a specified stable setShuya Chiba, Yoshimi Egawa, Kiyoshi Yoshimoto. ajc, 46:203-210, 2010. [doi]

Set-orderedness as a generalization of k-orderedness and cyclabilityKeishi Ishii, Kenta Ozeki, Kiyoshi Yoshimoto. DM, 310(17-18):2310-2316, 2010. [doi]

Closure concept for 2-factors in claw-free graphsZdenek Ryjácek, Liming Xiong, Kiyoshi Yoshimoto. DM, 310(10-11):1573-1579, 2010. [doi]

2009

2008

On a Spanning Tree with Specified LeavesYoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto. gc, 24(1):13-18, 2008. [doi]

Relative length of longest paths and longest cycles in triangle-free graphsDaniël Paulusma, Kiyoshi Yoshimoto. DM, 308(7):1222-1229, 2008. [doi]

Edge degrees and dominating cyclesKiyoshi Yoshimoto. DM, 308(12):2594-2599, 2008. [doi]

2007

On components of 2-factors in claw-free graphsHajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto. endm, 29:289-293, 2007. [doi]

Toughness and hamiltonicity in k-treesHajo Broersma, Liming Xiong, Kiyoshi Yoshimoto. DM, 307(7-8):832-838, 2007. [doi]

The upper bound of the number of cycles in a 2-factor of a line graphJun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui Zhang. jgt, 55(1):72-82, 2007. [doi]

Even subgraphs of bridgeless graphs and 2-factors of line graphsBill Jackson, Kiyoshi Yoshimoto. DM, 307(22):2775-2785, 2007. [doi]

Cycles through specified vertices in triangle-free graphsDaniël Paulusma, Kiyoshi Yoshimoto. dmgt, 27(1):179-191, 2007. [doi]

On the number of components in 2-factors of claw-free graphsKiyoshi Yoshimoto. DM, 307(22):2808-2819, 2007. [doi]

2005

Heavy cycles passing through some specified vertices in weighted graphsJun Fujisawa, Kiyoshi Yoshimoto, Shenggui Zhang. jgt, 49(2):93-103, 2005. [doi]

2003

A 2-factor with two components of a graph satisfying the Chvátal-Erdös conditionAtsushi Kaneko, Kiyoshi Yoshimoto. jgt, 43(4):269-279, 2003. [doi]

2002

On geometric independency trees for points in the planeAtsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto. DM, 258(1-3):93-104, 2002. [doi]

On a 2-factor with a specified edge in a graph satisfying the Ore conditionAtsushi Kaneko, Kiyoshi Yoshimoto. DM, 257(2-3):445-461, 2002. [doi]

On a hamiltonian cycle in which specified vertices are not isolatedAtsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto. DM, 258(1-3):85-91, 2002. [doi]

2001

On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly DistributedAtsushi Kaneko, Kiyoshi Yoshimoto. JCT, 81(1):100-109, 2001. [doi]

Transformation of Spanning Trees in a 2-Connected GraphTakayuki Nakamura, Kiyoshi Yoshimoto. arscom, 60, 2001.

The Connectivities of Trunk Graphs of Connected GraphsKiyoshi Yoshimoto. arscom, 60, 2001.

2000

On spanning trees with restricted degreesAtsushi Kaneko, Kiyoshi Yoshimoto. ipl, 73(5-6):163-165, 2000. [doi]

A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös conditionAtsushi Kaneko, Kiyoshi Yoshimoto. endm, 5:198-200, 2000. [doi]

Alternating Hamilton Cycles with Minimum Number of Crossings in the PlaneAtsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto. ijcga, 10(1):73-78, 2000.

Hamiltonian cycles of certain kinds of graphs satisfying Dirac conditionKiyoshi Yoshimoto. endm, 5:315-316, 2000. [doi]

1999

The Connectivities of Leaf Graphs of 2-Connected GraphsAtsushi Kaneko, Kiyoshi Yoshimoto. JCT, 76(2):155-169, 1999. [doi]

Some results on geometric independency treesAtsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto. cccg 1999: [doi]

Sign in or sign up to see more results.

runs on WebDSL