Given a graph G, a set of spanning trees of G are completely independent spanning trees (CISTs for short) if for any vertices x and y, the paths connecting them on these trees have neither vertex nor edge in common, except x and y. Hasunuma (2001, 2002) first introduced the concept of CISTs and conjectured that there are k CISTs in any 2kconnected graph. Later on, this conjecture was unfortunately disproved by Peterfalvi (2012). In this note, we show that Hasunuma's conjecture holds for graphs restricted in the class of 4-regular chordal rings CR(n; d), where both n and d are even integers.
|頁（從 - 到）||1932-1935|
|期刊||IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences|
|出版狀態||已發佈 - 2017 9月|
ASJC Scopus subject areas