Satoshi Tagusari

According to our database, Satoshi Tagusari authored at least 10 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On strict-double-bound graphs and Cartesian products of paths and cycles.

Yoshimi Egawa, Kenjiro Ogawa, Kenta Ozeki, Satoshi Tagusari, Morimasa Tsuchiya

Discret. Math. Algorithms Appl., July, 2024

2021

On strict-double-bound numbers of graphs and cut sets.

Kazutaka Ikeda, Kenjiro Ogawa, Satoshi Tagusari, Shin-Ichiro Tashiro, Morimasa Tsuchiya

Electron. J. Graph Theory Appl., 2021

2018

Note on p-competition graphs of spiders.

Kyohei Nakada, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya

Discret. Math. Algorithms Appl., 2018

2015

On strict-double-bound numbers of caterpillars.

Kenjiro Ogawa, Yuhei Shiraki, Satoshi Tagusari, Morimasa Tsuchiya

Discret. Math. Algorithms Appl., 2015

2013

On strict-double-bound numbers of spiders and ladders.

Syota Konishi, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya

Ars Comb., 2013

2012

Note on strict-double-bound numbers of nearly complete graphs missing some edges.

Kenjiro Ogawa, Ryoko Soejima, Satoshi Tagusari, Morimasa Tsuchiya

Discret. Math., 2012

2010

On distance two graphs of upper bound graphs.

Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya

Discret. Math., 2010

2009

Note on upper bound graphs and forbidden subposets.

Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya

Discret. Math., 2009

2006

On double bound graphs and forbidden subposets.

Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya

Electron. Notes Discret. Math., 2006

2005

On upper bound graphs with forbidden subposets.

Hiroshi Era, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya

Electron. Notes Discret. Math., 2005