Results 1 to 10 of about 901,024 (319)
On dynamic colouring of cartesian product of complete graph with some graphs [PDF]
Journal of Taibah University for Science, 2020 A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj +2 more
doaj +3 more sources
Constructing operating theatre schedules using partitioned graph colouring techniques. [PDF]
Health Syst (Basingstoke), 2021 In hospitals, scheduled operations can often be cancelled in large numbers due to the unavailability of beds for post-operation recovery. Operating theatre scheduling is known to be an -hard optimisation problem.
Kheiri A, Lewis R, Thompson J, Harper P.
europepmc +2 more sources
Nonrepetitive graph colouring [PDF]
The Electronic Journal of Combinatorics, 2020 A vertex colouring of a graph $G$ is nonrepetitive if $G$ contains no path for which the first half of the path is assigned the same sequence of colours as the second half. Thue's famous theorem says that every path is nonrepetitively 3-colourable.
D. Wood
semanticscholar +4 more sources
On graphs double-critical with respect to the colouring number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The colouring number col($G$) of a graph $G$ is the smallest integer $k$ for which there is an ordering of the vertices of $G$ such that when removing the vertices of $G$ in the specified order no vertex of degree more than $k-1$ in the remaining graph ...
Matthias Kriesell, Anders Pedersen
doaj +2 more sources
Anagram-Free Graph Colouring [PDF]
The Electronic Journal of Combinatorics, 2016 An anagram is a word of the form $WP$ where $W$ is a non-empty word and $P$ is a permutation of $W$. We study anagram-free graph colouring and give bounds on the chromatic number. Alon et al.
Tim E. Wilson, D. Wood
semanticscholar +4 more sources
Edge Colouring of Neutrosophic Graphs and Its Application in Detection of Phishing Website [PDF]
Discrete Dynamics in Nature and Society, 2022 Graph colouring enjoys many practical as well as theoretical uses. Graph colouring is still a very active subject of research. This article introduces a new concept of the chromatic number of the neutrosophic graph (NG).
Rupkumar Mahapatra +2 more
doaj +2 more sources
Homogeneous colourings of graphs [PDF]
Mathematica Bohemica, 2023 A proper vertex $k$-colouring of a graph $G$ is called $l$-homogeneous if the number of colours in the neigbourhood of each vertex of $G$ equals $l$. We explore basic properties (the existence and the number of used colours) of homogeneous colourings of ...
Tomáš Madaras, Mária Šurimová
doaj +2 more sources
Mixed graph colouring as scheduling multi-processor tasks with equal processing times
Журнал Белорусского государственного университета: Математика, информатика, 2021 A problem of scheduling partially ordered unit-time tasks processed on dedicated machines is formulated as a mixed graph colouring problem, i. e., as an assignment of integers (colours) {1, 2, …, t} to the vertices (tasks) V {ν1, ν2, …, νn}, of the mixed
Yuri N. Sotskov
doaj +2 more sources
Graph colouring algorithms [PDF]
arXiv.org, 2015 This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to
T. Husfeldt
semanticscholar +4 more sources
Rainbow Colouring of Split Graphs [PDF]
Discrete Applied Mathematics, 2014 A rainbow path in an edge coloured graph is a path in which no two edges are coloured the same. A rainbow colouring of a connected graph G is a colouring of the edges of G such that every pair of vertices in G is connected by at least one rainbow path.
L. Sunil Chandran +2 more
openalex +3 more sources