244 search results - page 20 / 49 » Intervalizing k-Colored Graphs |
87
Voted
DAM
2006
14 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...
4OR
2005
14 years 9 months ago
2005
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
ORL
2008
14 years 9 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
92
Voted
DAM
2011
14 years 4 months ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...