1027 search results - page 107 / 206 » Ordered Vertex Partitioning |
DAM
2006
13 years 9 months ago
2006
We prove that a triangle-free graph G is a tolerance graph if and only if there exists a set of consecutively ordered stars that partition the edges of G. Since tolerance graphs a...
JCT
2002
13 years 8 months ago
2002
We present a result which is obtained by combining a result of Carlson with the Finitary Dual Ramsey Theorem of Graham-Rothschild. We start by introducing some notation. We confor...
IPMU
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we extend a methodology for constructing a frame of discernment from belief functions for one problem, into a methodology for constructing multiple frames of discernm...
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
WADS
2007
Springer
14 years 3 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...