550 research outputs found

    Oriented Colourings of Graphs with Maximum Degree Three and Four

    Full text link
    We show that any orientation of a graph with maximum degree three has an oriented 9-colouring, and that any orientation of a graph with maximum degree four has an oriented 69-colouring. These results improve the best known upper bounds of 11 and 80, respectively

    A Study of kk-dipath Colourings of Oriented Graphs

    Full text link
    We examine tt-colourings of oriented graphs in which, for a fixed integer k≥1k \geq 1, vertices joined by a directed path of length at most kk must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the case k=2k=2 is described. Dichotomy theorems for the complexity of the problem of deciding, for fixed kk and tt, whether there exists such a tt-colouring are proved.Comment: 14 page

    Generalisation : graphs and colourings

    Get PDF
    The interaction between practice and theory in mathematics is a central theme. Many mathematical structures and theories result from the formalisation of a real problem. Graph Theory is rich with such examples. The graph structure itself was formalised by Leonard Euler in the quest to solve the problem of the Bridges of Königsberg. Once a structure is formalised, and results are proven, the mathematician seeks to generalise. This can be considered as one of the main praxis in mathematics. The idea of generalisation will be illustrated through graph colouring. This idea also results from a classic problem, in which it was well known by topographers that four colours suffice to colour any map such that no countries sharing a border receive the same colour. The proof of this theorem eluded mathematicians for centuries and was proven in 1976. Generalisation of graphs to hypergraphs, and variations on the colouring theme will be discussed, as well as applications in other disciplines.peer-reviewe

    Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

    Get PDF
    A kk-bisection of a bridgeless cubic graph GG is a 22-colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes (monochromatic components in what follows) have order at most kk. Ban and Linial conjectured that every bridgeless cubic graph admits a 22-bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph GG with ∣E(G)∣≡0(mod2)|E(G)| \equiv 0 \pmod 2 has a 22-edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (i.e. a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we give a detailed insight into the conjectures of Ban-Linial and Wormald and provide evidence of a strong relation of both of them with Ando's conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above mentioned conjectures. Moreover, we prove Ban-Linial's conjecture for cubic cycle permutation graphs. As a by-product of studying 22-edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.Comment: 33 pages; submitted for publicatio
    • …
    corecore