2 citations · 3 across the 5 of their papers we have counts for
5 papers
Refinements of degree conditions for the existence of a spanning tree without small degree stems
Michitaka Furuya, Akira Saito, Shoichi Tsuchiya
A spanning tree of a graph without no vertices of degree is called a {\it homeomorphically irreducible spanning tree} (or a {\it HIST}) of the graph. Albertson, Berman, Hutchin…
Representing split graphs by words
Herman Z. Q. Chen, Sergey Kitaev, Akira Saito
There is a long line of research in the literature dedicated to word-representable graphs, which generalize several important classes of graphs. However, not much is known about wo…
On semi-transitive orientability of Kneser graphs and their complements
Sergey Kitaev, Akira Saito
An orientation of a graph is semi-transitive if it is acyclic, and for any directed path either there is no edge between …
Spanning trails with maximum degree at most 4 in -free graphs
Guantao Chen, M. N. Ellingham, Akira Saito +1
A graph is called -free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every -tough -free graph wi…
Precoloring extension involving pairs of vertices of small distance
Chihoko Ojima, Akira Saito, Kazuki Sano
In this paper, we consider coloring of graphs under the assumption that some vertices are already colored. Let be an -colorable graph and let . Albertson [J.\…