711 research outputs found
List-edge-colouring planar graphs with precoloured edges
Let be a simple planar graph of maximum degree , let be a
positive integer, and let be an edge list assignment on with for all . We prove that if is a subgraph of
that has been -edge-coloured, then the edge-precolouring can be extended to
an -edge-colouring of , provided that has maximum degree
and either or is large enough (
suffices). If , there are examples for any choice of where the
extension is impossible.Comment: 14 pages, 3 figures, 1 tabl
The Complexity of Change
Many combinatorial problems can be formulated as "Can I transform
configuration 1 into configuration 2, if certain transformations only are
allowed?". An example of such a question is: given two k-colourings of a graph,
can I transform the first k-colouring into the second one, by recolouring one
vertex at a time, and always maintaining a proper k-colouring? Another example
is: given two solutions of a SAT-instance, can I transform the first solution
into the second one, by changing the truth value one variable at a time, and
always maintaining a solution of the SAT-instance? Other examples can be found
in many classical puzzles, such as the 15-Puzzle and Rubik's Cube.
In this survey we shall give an overview of some older and more recent work
on this type of problem. The emphasis will be on the computational complexity
of the problems: how hard is it to decide if a certain transformation is
possible or not?Comment: 28 pages, 6 figure
Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere
Let be a properly face 2-coloured (say black and white) \break
piecewise-linear triangulation of the sphere with vertex set . Consider the
abelian group generated by the set , with relations
for all white triangles with vertices , and . The group
can be defined similarly, using black triangles. These groups
are related in the following manner
where is a finite abelian group.
The finite torsion subgroup is referred to as the canonical
group of the triangulation. Let be the maximal order of
over all properly face two-coloured spherical triangulations with triangles
of each colour. By relating properly face two-coloured spherical triangulations
to directed Eulerian spherical embeddings of digraphs whose abelian sand-pile
groups are isomorphic to we provide improved upper and lower
bounds for .Comment: Added figures to illustrate proofs. Also improved expositio
3-facial colouring of plane graphs
A plane graph is l-facially k-colourable if its vertices can be coloured with
k colours such that any two distinct vertices on a facial segment of length at
most l are coloured differently. We prove that every plane graph is 3-facially
11-colourable. As a consequence, we derive that every 2-connected plane graph
with maximum face-size at most 7 is cyclically 11-colourable. These two bounds
are for one off from those that are proposed by the (3l+1)-Conjecture and the
Cyclic Conjecture
Choosability of the square of a planar graph with maximum degree four
We study squares of planar graphs with the aim to determine their list
chromatic number. We present new upper bounds for the square of a planar graph
with maximum degree . In particular is 5-, 6-, 7-, 8-,
12-, 14-choosable if the girth of is at least 16, 11, 9, 7, 5, 3
respectively. In fact we prove more general results, in terms of maximum
average degree, that imply the results above.Comment: 14 pages, 6 figures; fixed typ
The Glauber dynamics for edge-colourings of trees
Let be a tree on vertices and with maximum degree . We show
that for the Glauber dynamics for -edge-colourings of
mixes in polynomial time in . The bound on the number of colours is best
possible as the chain is not even ergodic for . Our proof uses a
recursive decomposition of the tree into subtrees; we bound the relaxation time
of the original tree in terms of the relaxation time of its subtrees using
block dynamics and chain comparison techniques. Of independent interest, we
also introduce a monotonicity result for Glauber dynamics that simplifies our
proof.Comment: 29 page
Coloring plane graphs with independent crossings
We show that every plane graph with maximum face size four whose all faces of
size four are vertex-disjoint is cyclically 5-colorable. This answers a
question of Albertson whether graphs drawn in the plane with all crossings
independent are 5-colorable
Checkerboard graph monodromies
We associate an open book with any connected plane checkerboard graph, thus
providing a common extension of the classes of prime positive braid links and
positive tree-like Hopf plumbings. As an application, we prove that the link
type of a prime positive braid closure is determined by the linking graph
associated with that braid.Comment: 23 pages, 12 figures; v2: minor changes and corrections. This version
corresponds to the published articl
List-coloring the Square of a Subcubic Graph
The {\em square} of a graph is the graph with the same vertex set
as and with two vertices adjacent if their distance in is at most 2.
Thomassen showed that every planar graph with maximum degree
satisfies . Kostochka and Woodall conjectured that for every
graph, the list-chromatic number of equals the chromatic number of ,
that is for all . If true, this conjecture (together
with Thomassen's result) implies that every planar graph with
satisfies . We prove that every connected graph (not
necessarily planar) with other than the Petersen graph satisfies
(and this is best possible). In addition, we show that if
is a planar graph with and girth , then
. Dvo\v{r}\'ak, \v{S}krekovski, and Tancer showed that if
is a planar graph with and girth , then
. We improve the girth bound to show that if is a planar
graph with and , then . All of
our proofs can be easily translated into linear-time coloring algorithms.Comment: This is the accepted version of the journal paper referenced below,
which has been published in final form at
http://onlinelibrary.wiley.com/doi/10.1002/jgt.20273/abstract. The abstract
incorrectly stated that Thomassen solved Wegner's Conjecture for
; however, all of our results are correc
Aspects of graph colouring
The four-colour conjecture of 1852, and the total colouring conjecture of 1965, have sparked off many new concepts and conjectures. In this thesis we investigate many of the outstanding conjectures, establishing various related results, and present many conjectures of our own. We give a brief historical introduction (Chapter 1) and establish some notation, terminology and techniques (Chapter 2). Next, in Chapter 3, we examine the use of latin squares to represent edge and total colourings. In Chapters 4 - 6 we deal with vertex, edge and total colourings respectively. Various ways of measuring different aspects of graphs are presented, in particular, the ‘colouring difference’ between two edge-colourings of a graph (Chapter 5) and the ‘beta parameter’ (defined in Chapter 2 and used in Chapters 3 and 6); this is a measure of how far from a type 1 graph a type 2 graph can be. In Chapter 6 we derive an upper bound for the beta value of any near type 1 graph and give the exact results for all Kn. The number of ways of colouring Kn and Kn,,n are also quantified. Chapter 6 also examines Hilton’s concept of conformability. It is shown that every graph with at least A spines is conformable, and an extension to the concept, which we call G*-conformability, is introduced. We then give new necessary conditions for a cubic graph to be type 1 in relation to G*-conformability. Various methods of manipulating graphs are considered and we present: a method to compatibly triangulate a graph G-e; a method of introducing a fourth colour thus allowing a sequence of Kempe interchanges from any edge 3-colouring of a cubic graph to any other; and a method to re-colour a near type 1 graph within a certain bound on beta. We end this thesis with a brief discussion on possible practical uses for colouring graphs. A list of the main results and conjectures is given at the end of each chapter, but a short list of the principle theorems proven is given below
- …