251 search results - page 19 / 51 » The Graphs with All Subgraphs T-Perfect |
DM
2010
13 years 7 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
ISI
2007
Springer
14 years 1 months ago
2007
Springer
Graph data represents relationships, connections, or affinities. Innocent relationships produce repeated, and so common, substructures in graph data. We present techniques for dis...
COMBINATORICS
2006
13 years 7 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
WG
2004
Springer
14 years 1 months ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...