10,250 research outputs found
Coloring triangle-free rectangle overlap graphs with colors
Recently, it was proved that triangle-free intersection graphs of line
segments in the plane can have chromatic number as large as . Essentially the same construction produces -chromatic
triangle-free intersection graphs of a variety of other geometric
shapes---those belonging to any class of compact arc-connected sets in
closed under horizontal scaling, vertical scaling, and
translation, except for axis-parallel rectangles. We show that this
construction is asymptotically optimal for intersection graphs of boundaries of
axis-parallel rectangles, which can be alternatively described as overlap
graphs of axis-parallel rectangles. That is, we prove that triangle-free
rectangle overlap graphs have chromatic number , improving on
the previous bound of . To this end, we exploit a relationship
between off-line coloring of rectangle overlap graphs and on-line coloring of
interval overlap graphs. Our coloring method decomposes the graph into a
bounded number of subgraphs with a tree-like structure that "encodes"
strategies of the adversary in the on-line coloring problem. Then, these
subgraphs are colored with colors using a combination of
techniques from on-line algorithms (first-fit) and data structure design
(heavy-light decomposition).Comment: Minor revisio
A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
Combining tree decomposition and transfer matrix techniques provides a very
general algorithm for computing exact partition functions of statistical models
defined on arbitrary graphs. The algorithm is particularly efficient in the
case of planar graphs. We illustrate it by computing the Potts model partition
functions and chromatic polynomials (the number of proper vertex colourings
using Q colours) for large samples of random planar graphs with up to N=100
vertices. In the latter case, our algorithm yields a sub-exponential average
running time of ~ exp(1.516 sqrt(N)), a substantial improvement over the
exponential running time ~ exp(0.245 N) provided by the hitherto best known
algorithm. We study the statistics of chromatic roots of random planar graphs
in some detail, comparing the findings with results for finite pieces of a
regular lattice.Comment: 5 pages, 3 figures. Version 2 has been substantially expanded.
Version 3 shows that the worst-case running time is sub-exponential in the
number of vertice
Tree-chromatic number
Abstract Let us say a graph G has "tree-chromatic number" at most k if it admits a tree-decomposition (T, (X t : t ∈ V (T ))) such that G[X t ] has chromatic number at most k for each t ∈ V (T ). This seems to be a new concept, and this paper is a collection of observations on the topic. In particular we show that there are graphs with tree-chromatic number two and with arbitrarily large chromatic number; and for all ℓ ≥ 4, every graph with no triangle and with no induced cycle of length more than ℓ has tree-chromatic number at most ℓ − 2
On the structure of (pan, even hole)-free graphs
A hole is a chordless cycle with at least four vertices. A pan is a graph
which consists of a hole and a single vertex with precisely one neighbor on the
hole. An even hole is a hole with an even number of vertices. We prove that a
(pan, even hole)-free graph can be decomposed by clique cutsets into
essentially unit circular-arc graphs. This structure theorem is the basis of
our -time certifying algorithm for recognizing (pan, even hole)-free
graphs and for our -time algorithm to optimally color them.
Using this structure theorem, we show that the tree-width of a (pan, even
hole)-free graph is at most 1.5 times the clique number minus 1, and thus the
chromatic number is at most 1.5 times the clique number.Comment: Accepted to appear in the Journal of Graph Theor
- …