Kiyoshi Yoshimoto

Kiyoshi Yoshiomoto

	2013
j32		Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto: 4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski. SIAM J. Discrete Math. 27(1): 141-144 (2013)
	2012
j31		Roman Kuzel, Kenta Ozeki, Kiyoshi Yoshimoto: 2-factors and independent sets on claw-free graphs. Discrete Mathematics 312(2): 202-206 (2012)
j30		Ralph J. Faudree, Colton Magnant, Kenta Ozeki, Kiyoshi Yoshimoto: Claw-free graphs and 2-factors that separate independent vertices. Journal of Graph Theory 69(3): 251-263 (2012)
	2011
j29		Roman Cada, Shuya Chiba, Kiyoshi Yoshimoto: 2-factors in claw-free graphs. Electronic Notes in Discrete Mathematics 38: 213-219 (2011)
	2010
j28		Zdenek Ryjácek, Liming Xiong, Kiyoshi Yoshimoto: Closure concept for 2-factors in claw-free graphs. Discrete Mathematics 310(10-11): 1573-1579 (2010)
j27		Keishi Ishii, Kenta Ozeki, Kiyoshi Yoshimoto: Set-orderedness as a generalization of k-orderedness and cyclability. Discrete Mathematics 310(17-18): 2310-2316 (2010)
	2009
j26		H. J. Broersma, Jun Fujisawa, L. Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto: lambda-backbone colorings along pairwise disjoint stars and matchings. Discrete Mathematics 309(18): 5596-5609 (2009)
j25		Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto: Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs. Graphs and Combinatorics 25(4): 427-460 (2009)
j24		Bill Jackson, Kiyoshi Yoshimoto: Spanning even subgraphs of 3-edge-connected graphs. Journal of Graph Theory 62(1): 37-47 (2009)
	2008
j23		Daniël Paulusma, Kiyoshi Yoshimoto: Relative length of longest paths and longest cycles in triangle-free graphs. Discrete Mathematics 308(7): 1222-1229 (2008)
j22		Kiyoshi Yoshimoto: Edge degrees and dominating cycles. Discrete Mathematics 308(12): 2594-2599 (2008)
j21		Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto: On a Spanning Tree with Specified Leaves. Graphs and Combinatorics 24(1): 13-18 (2008)
	2007
j20		Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto: Toughness and hamiltonicity in k-trees. Discrete Mathematics 307(7-8): 832-838 (2007)
j19		Bill Jackson, Kiyoshi Yoshimoto: Even subgraphs of bridgeless graphs and 2-factors of line graphs. Discrete Mathematics 307(22): 2775-2785 (2007)
j18		Kiyoshi Yoshimoto: On the number of components in 2-factors of claw-free graphs. Discrete Mathematics 307(22): 2808-2819 (2007)
j17		Daniël Paulusma, Kiyoshi Yoshimoto: Cycles through specified vertices in triangle-free graphs. Discussiones Mathematicae Graph Theory 27(1): 179-191 (2007)
j16		Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto: On components of 2-factors in claw-free graphs. Electronic Notes in Discrete Mathematics 29: 289-293 (2007)
j15		Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui Zhang: The upper bound of the number of cycles in a 2-factor of a line graph. Journal of Graph Theory 55(1): 72-82 (2007)
	2005
j14		Jun Fujisawa, Kiyoshi Yoshimoto, Shenggui Zhang: Heavy cycles passing through some specified vertices in weighted graphs. Journal of Graph Theory 49(2): 93-103 (2005)
	2003
j13		Atsushi Kaneko, Kiyoshi Yoshimoto: A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. Journal of Graph Theory 43(4): 269-279 (2003)
	2002
j12		Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto: Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64: 239- (2002)
j11		Atsushi Kaneko, Kiyoshi Yoshimoto: On a 2-factor with a specified edge in a graph satisfying the Ore condition. Discrete Mathematics 257(2-3): 445-461 (2002)
j10		Atsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto: On a hamiltonian cycle in which specified vertices are not isolated. Discrete Mathematics 258(1-3): 85-91 (2002)
j9		Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto: On geometric independency trees for points in the plane. Discrete Mathematics 258(1-3): 93-104 (2002)
	2001
j8		Takayuki Nakamura, Kiyoshi Yoshimoto: Transformation of Spanning Trees in a 2-Connected Graph. Ars Comb. 60 (2001)
j7		Kiyoshi Yoshimoto: The Connectivities of Trunk Graphs of Connected Graphs. Ars Comb. 60 (2001)
j6		Atsushi Kaneko, Kiyoshi Yoshimoto: On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed. J. Comb. Theory, Ser. B 81(1): 100-109 (2001)
	2000
j5		Atsushi Kaneko, Kiyoshi Yoshimoto: 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 5: 198-200 (2000)
j4		Kiyoshi Yoshimoto: Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition. Electronic Notes in Discrete Mathematics 5: 315-316 (2000)
j3		Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto: Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. Int. J. Comput. Geometry Appl. 10(1): 73-78 (2000)
j2		Atsushi Kaneko, Kiyoshi Yoshimoto: On spanning trees with restricted degrees. Inf. Process. Lett. 73(5-6): 163-165 (2000)
	1999
j1		Atsushi Kaneko, Kiyoshi Yoshimoto: The Connectivities of Leaf Graphs of 2-Connected Graphs. J. Comb. Theory, Ser. B 76(2): 155-169 (1999)
c1		Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto: Some results on geometric independency trees. CCCG 1999

Coauthor Index

Last update Sun May 19 00:10:03 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page