147 search results - page 1 / 30 » Vertex partitions of chordal graphs |
JGT
2006
13 years 11 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
DM
2006
13 years 11 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
WG
2007
Springer
14 years 5 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
WALCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
IPL
2006
13 years 11 months ago
2006
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...