Sciweavers

JGT
2006
70views more  JGT 2006»
13 years 4 months ago
Vertex partitions of chordal graphs
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...
David R. Wood
COMBINATORICA
2006
137views more  COMBINATORICA 2006»
13 years 4 months ago
Extremal Problems For Transversals In Graphs With Bounded Degree
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
Tibor Szabó, Gábor Tardos