Kiyoshi Yoshimoto

Kiyoshi Yoshiomoto

	2008
21		Kiyoshi Yoshimoto: Edge degrees and dominating cycles. Discrete Mathematics 308(12): 2594-2599 (2008)
20		Daniël Paulusma, Kiyoshi Yoshimoto: Relative length of longest paths and longest cycles in triangle-free graphs. Discrete Mathematics 308(7): 1222-1229 (2008)
	2007
19		Bill Jackson, Kiyoshi Yoshimoto: Even subgraphs of bridgeless graphs and 2-factors of line graphs. Discrete Mathematics 307(22): 2775-2785 (2007)
18		Kiyoshi Yoshimoto: On the number of components in 2-factors of claw-free graphs. Discrete Mathematics 307(22): 2808-2819 (2007)
17		Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto: Toughness and hamiltonicity in k-trees. Discrete Mathematics 307(7-8): 832-838 (2007)
16		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)
15		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
14		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)
	2002
13		Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto: Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64: 239- (2002)
12		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)
11		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)
10		Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto: On geometric independency trees for points in the plane. Discrete Mathematics 258(1-3): 93-104 (2002)
	2001
9		Kiyoshi Yoshimoto: The Connectivities of Trunk Graphs of Connected Graphs. Ars Comb. 60: (2001)
8		Takayuki Nakamura, Kiyoshi Yoshimoto: Transformation of Spanning Trees in a 2-Connected Graph. Ars Comb. 60: (2001)
7		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
6		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)
5		Kiyoshi Yoshimoto: Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition. Electronic Notes in Discrete Mathematics 5: 315-316 (2000)
4		Atsushi Kaneko, Kiyoshi Yoshimoto: On spanning trees with restricted degrees. Inf. Process. Lett. 73(5-6): 163-165 (2000)
3		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)
	1999
2		Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto: Some results on geometric independency trees. CCCG 1999
1		Atsushi Kaneko, Kiyoshi Yoshimoto: The Connectivities of Leaf Graphs of 2-Connected Graphs. J. Comb. Theory, Ser. B 76(2): 155-169 (1999)

Coauthor Index

1	Kiyoshi Ando	[13]
2	Hajo Broersma (H. J. Broersma)	[16] [17]
3	Jun Fujisawa	[14] [15]
4	Bill Jackson	[19]
5	Atsushi Kaneko	[1] [2] [3] [4] [6] [7] [10] [11] [12] [13]
6	Mikio Kano (M. Kano)	[3]
7	Ken-ichi Kawarabayashi	[11] [13]
8	Takayuki Nakamura	[8]
9	Yoshiaki Oda	[2] [10]
10	Katsuhiro Ota	[11]
11	Daniël Paulusma	[16] [20]
12	Liming Xiong	[15] [17]
13	Shenggui Zhang	[14] [15]

Colors in the list of coauthors