Further characterizations and Helly-property in k-trees
Keyword(s):
The purpose of this paper is to obtain a characterization of $k$-trees in terms of $k$-connectivity and forbidden subgraphs. Also, we present the other characterizations of $k$-trees containing the full vertices by using the join operation. Further, we establish the property of $k$-trees dealing with the degrees and formulate the Helly-property for a family of nontrivial $k$-paths in a $k$-tree. We study the planarity of $k$-trees and express the maximal outerplanar graphs in terms of 2-trees and $K_2$-neighbourhoods. Finally, the similar type of results for the maximal planar graphs are obtained.
2007 ◽
Vol 44
(3)
◽
pp. 411-422
◽
Keyword(s):
2007 ◽
Vol 17
(02)
◽
pp. 139-160
◽
Keyword(s):
Keyword(s):
1988 ◽
Vol 46
◽
pp. 830-831
Keyword(s):
1982 ◽
Vol 47
(03)
◽
pp. 197-202
◽
Keyword(s):
Keyword(s):
Keyword(s):