In this paper, it is proven that the pagenumber of a k-tree is at most k+1. Furthermore, it is shown that there exist k-trees that require k pages.
In this paper, it is proven that the pagenumber of a k-tree is at most k + 1. Furthermore, it is shown that there exist k-trees that require k pages. The upper ...
Missing: O( | Show results with:O(
In this paper, it is proven that the pagenumber of a k-tree is at most k + 1. Furthermore, it is shown that there exist k-trees that require k pages. The upper ...
Jan 4, 2008 · First, we present an algorithm that embeds many k-trees in k pages, using tree-decompo- ... Heath, The pagenumber of k-tree is O(k). Discr. Appl.
The pagenumber of G is the least p such that G has a p-page embedding. We disprove a conjecture of Ganley and Heath by showing that when k ≥ 3 , there are k- ...
Oct 2, 1995 · A k-tree is a graph defined inductively in the following way: the complete graph K(sub-k) is a K-tree, and if G is a k-tree, then the graph ...
Feb 14, 2009 · Since deleting edges does not increase pagenumber, upper bounds on the pagenumber of k-trees are ... Heath, The pagenumber of k-tree is O(k).
The pagenumber of k-trees is O(k). Article. May 2001; DISCRETE APPL MATH. Joseph ... In this paper, it is proven that the pagenumber of a k-tree is at most k+1.
People also ask
What is the K cardinality tree problem?
What is the maximum number of spanning trees in a graph?
... The pagenumber of k-trees is O(k). L. Ganley J., S. Heath L. Q2. Elsevier. Discrete Applied Mathematics , 2001 , citations by CoLab: 34 | Abstract. A k -tree is ...
The pagenumber of k-trees is O(k). 2001, Discrete Applied Mathematics. Show ... In this paper, it is proven that the pagenumber of a k-tree is at most k+1.