2 search results - page 1 / 1 » Graphs with bounded tree-width and large odd-girth are almos... |
JCT
2010
13 years 9 months ago
2010
We prove that for every k and every ε > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + ε...
JGT
2006
13 years 11 months ago
2006
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...