6 research outputs found
Boxicity and topological invariants
The boxicity of a graph is the smallest integer for which there
exist interval graphs , , such that . In the first part of this note, we prove that every graph on
edges has boxicity , which is asymptotically best
possible. We use this result to study the connection between the boxicity of
graphs and their Colin de Verdi\`ere invariant, which share many similarities.
Known results concerning the two parameters suggest that for any graph , the
boxicity of is at most the Colin de Verdi\`ere invariant of , denoted by
. We observe that every graph has boxicity , while there are graphs with boxicity . In the second part of this note, we focus on graphs embeddable on a
surface of Euler genus . We prove that these graphs have boxicity
, while some of these graphs have boxicity . This improves the previously best known upper and lower bounds.
These results directly imply a nearly optimal bound on the dimension of the
adjacency poset of graphs on surfaces.Comment: 6 page
Box representations of embedded graphs
A -box is the cartesian product of intervals of and a
-box representation of a graph is a representation of as the
intersection graph of a set of -boxes in . It was proved by
Thomassen in 1986 that every planar graph has a 3-box representation. In this
paper we prove that every graph embedded in a fixed orientable surface, without
short non-contractible cycles, has a 5-box representation. This directly
implies that there is a function , such that in every graph of genus , a
set of at most vertices can be removed so that the resulting graph has a
5-box representation. We show that such a function can be made linear in
. Finally, we prove that for any proper minor-closed class ,
there is a constant such that every graph of
without cycles of length less than has a 3-box representation,
which is best possible.Comment: 16 pages, 6 figures - revised versio
Defective and Clustered Graph Colouring
Consider the following two ways to colour the vertices of a graph where the
requirement that adjacent vertices get distinct colours is relaxed. A colouring
has "defect" if each monochromatic component has maximum degree at most
. A colouring has "clustering" if each monochromatic component has at
most vertices. This paper surveys research on these types of colourings,
where the first priority is to minimise the number of colours, with small
defect or small clustering as a secondary goal. List colouring variants are
also considered. The following graph classes are studied: outerplanar graphs,
planar graphs, graphs embeddable in surfaces, graphs with given maximum degree,
graphs with given maximum average degree, graphs excluding a given subgraph,
graphs with linear crossing number, linklessly or knotlessly embeddable graphs,
graphs with given Colin de Verdi\`ere parameter, graphs with given
circumference, graphs excluding a fixed graph as an immersion, graphs with
given thickness, graphs with given stack- or queue-number, graphs excluding
as a minor, graphs excluding as a minor, and graphs excluding
an arbitrary graph as a minor. Several open problems are discussed.Comment: This is a preliminary version of a dynamic survey to be published in
the Electronic Journal of Combinatoric
Coloring planar graphs with three colors and no large monochromatic components
We prove the existence of a function such that
the vertices of every planar graph with maximum degree can be
3-colored in such a way that each monochromatic component has at most
vertices. This is best possible (the number of colors cannot be
reduced and the dependence on the maximum degree cannot be avoided) and answers
a question raised by Kleinberg, Motwani, Raghavan, and Venkatasubramanian in
1997. Our result extends to graphs of bounded genus.Comment: v3: fixed a notation issue in Section
Improper colourings inspired by Hadwiger’s conjecture
Hadwiger’s Conjecture asserts that every Kt-minor-free graph has a proper (t − 1)-colouring. We relax the conclusion in Hadwiger’s Conjecture via improper colourings. We prove that every Kt-minor-free graph is (2t − 2)-colourable with monochromatic components of order at most 1/2 (t − 2). This result has no more colours and much smaller monochromatic components than all previous results in this direction. We then prove that every Kt-minor-free graph is (t − 1)-colourable with monochromatic degree at most t − 2. This is the best known degree bound for such a result. Both these theorems are based on a decomposition method of independent interest. We give analogous results for Ks,t-minorfree graphs, which lead to improved bounds on generalised colouring numbers for these classes. Finally, we prove that graphs containing no Kt-immersion are 2-colourable with bounded monochromatic degree
From the plane to higher surfaces
AbstractWe show that Grötzschʼs theorem extends to all higher surfaces in the sense that every triangle-free graph on a surface of Euler genus g becomes 3-colorable after deleting a set of at most 1000⋅g⋅f(g) vertices where f(g) is the smallest edge-width which guarantees a graph of Euler genus g and girth 5 to be 3-colorable.We derive this result from a general cutting technique which we also use to extend other results on planar graphs to higher surfaces in the same spirit, even after deleting only 1000g vertices. These include the 5-list-color theorem, results on arboricity, and various types of colorings, and decomposition theorems of planar graphs into two graphs with prescribed degeneracy properties.It is not known if the 4-color theorem extends in this way