Tadashi Sakuma

List of publications from the DBLP Bibliography Server - FAQ

2008

6 EE Masahiro Hachimori, Hiroshi Kurata, Tadashi Sakuma: Determining the minimum rank of matroids whose basis graph is common. Electronic Notes in Discrete Mathematics 31: 137-142 (2008)

2006

5 EE Kenji Kashiwabara, Tadashi Sakuma: Grinstead's conjecture is true for graphs with a small clique number. Discrete Mathematics 306(19-20): 2572-2581 (2006)

4 EE Atsuhiro Nakamoto, Tadashi Sakuma, Yusuke Suzuki: N-flips in even triangulations on the sphere. Journal of Graph Theory 51(3): 260-268 (2006)

2001

3 Tadashi Sakuma: On kernel-less clique-acyclic orientations of minimally imperfect graphs. Discrete Applied Mathematics 115(1-3): 209-219 (2001)

2 EE Komei Fukuda, Alain Prodon, Tadashi Sakuma: Notes on acyclic orientations and the shelling lemma. Theor. Comput. Sci. 263(1-2): 9-16 (2001)

2000

1 EE Tadashi Sakuma: Forced color classes, intersection graphs and the strong perfect graph conjecture. Theor. Comput. Sci. 235(2): 309-324 (2000)

2008
6	EE	Masahiro Hachimori, Hiroshi Kurata, Tadashi Sakuma: Determining the minimum rank of matroids whose basis graph is common. Electronic Notes in Discrete Mathematics 31: 137-142 (2008)
2006
5	EE	Kenji Kashiwabara, Tadashi Sakuma: Grinstead's conjecture is true for graphs with a small clique number. Discrete Mathematics 306(19-20): 2572-2581 (2006)
4	EE	Atsuhiro Nakamoto, Tadashi Sakuma, Yusuke Suzuki: N-flips in even triangulations on the sphere. Journal of Graph Theory 51(3): 260-268 (2006)
2001
3		Tadashi Sakuma: On kernel-less clique-acyclic orientations of minimally imperfect graphs. Discrete Applied Mathematics 115(1-3): 209-219 (2001)
2	EE	Komei Fukuda, Alain Prodon, Tadashi Sakuma: Notes on acyclic orientations and the shelling lemma. Theor. Comput. Sci. 263(1-2): 9-16 (2001)
2000
1	EE	Tadashi Sakuma: Forced color classes, intersection graphs and the strong perfect graph conjecture. Theor. Comput. Sci. 235(2): 309-324 (2000)

Coauthor Index