164 research outputs found
Degenerate and star colorings of graphs on surfaces
AbstractWe study the degenerate, the star and the degenerate star chromatic numbers and their relation to the genus of graphs. As a tool we prove the following strengthening of a result of Fertin et al. (2004) [8]: If G is a graph of maximum degree Δ, then G admits a degenerate star coloring using O(Δ3/2) colors. We use this result to prove that every graph of genus g admits a degenerate star coloring with O(g3/5) colors. It is also shown that these results are sharp up to a logarithmic factor
Near-colorings: non-colorable graphs and NP-completeness
A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned
into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of
V_i has maximum degree at most d_i for all 1 <= i <= l. In this paper, we focus
on complexity aspects of such colorings when l=2,3. More precisely, we prove
that, for any fixed integers k,j,g with (k,j) distinct form (0,0) and g >= 3,
either every planar graph with girth at least g is (k,j)-colorable or it is
NP-complete to determine whether a planar graph with girth at least g is
(k,j)-colorable. Also, for any fixed integer k, it is NP-complete to determine
whether a planar graph that is either (0,0,0)-colorable or
non-(k,k,1)-colorable is (0,0,0)-colorable. Additionally, we exhibit
non-(3,1)-colorable planar graphs with girth 5 and non-(2,0)-colorable planar
graphs with girth 7
Branched Coverings, Triangulations, and 3-Manifolds
A canonical branched covering over each sufficiently good simplicial complex
is constructed. Its structure depends on the combinatorial type of the complex.
In this way, each closed orientable 3-manifold arises as a branched covering
over the 3-sphere from some triangulation of S^3. This result is related to a
theorem of Hilden and Montesinos. The branched coverings introduced admit a
rich theory in which the group of projectivities plays a central role.Comment: v2: several changes to the text body; minor correction
Planar graph coloring avoiding monochromatic subgraphs: trees and paths make things difficult
We consider the problem of coloring a planar graph with the minimum number of colors such that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem
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
Boxicity of graphs on surfaces
The boxicity of a graph is the least integer for which there
exist interval graphs , , such that . Scheinerman proved in 1984 that outerplanar graphs have boxicity
at most two and Thomassen proved in 1986 that planar graphs have boxicity at
most three. In this note we prove that the boxicity of toroidal graphs is at
most 7, and that the boxicity of graphs embeddable in a surface of
genus is at most . This result yields improved bounds on the
dimension of the adjacency poset of graphs on surfaces.Comment: 9 pages, 2 figure
- …