Results 21 to 30 of about 3,440 (243)
Problems and results on graph and hypergraph colouring
Le Matematiche, 1990 See directly the article.
Szolt Tuza
doaj +1 more source
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 +1 more source
On dynamic colouring of cartesian product of complete graph with some graphs
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 +1 more source
The achromatic number of K_{6} □ K_{7} is 18 [PDF]
Opuscula Mathematica, 2021 A vertex colouring \(f:V(G)\to C\) of a graph \(G\) is complete if for any two distinct colours \(c_1, c_2 \in C\) there is an edge \(\{v_1,v_2\}\in E(G)\) such that \(f(v_i)=c_i\), \(i=1,2\).
Mirko Horňák
doaj +1 more source
NP-completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem
Моделирование и анализ информационных систем, 2019 In this paper, we study the two-step colouring problem for an undirected connected graph. It is required to colour the graph in a given number of colours in a way, when no pair of vertices has the same colour, if these vertices are at a distance of 1 or ...
Natalya Sergeevna Medvedeva +1 more
doaj +1 more source
From light edges to strong edge-colouring of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$.
Julien Bensmail +3 more
doaj +1 more source
Backbone colouring and algorithms for TDMA scheduling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We investigate graph colouring models for the purpose of optimizing TDMA link scheduling in Wireless Networks. Inspired by the BPRN-colouring model recently introduced by Rocha and Sasaki, we introduce a new colouring model, namely the BMRN-colouring ...
Julien Bensmail +4 more
doaj +1 more source
Cop-width, flip-width and strong colouring numbers [PDF]
Discrete Mathematics & Theoretical Computer ScienceCop-width and flip-width are new families of graph parameters introduced by Toru\'nczyk (2023) that generalise treewidth, degeneracy, generalised colouring numbers, clique-width and twin-width.
Robert Hickingbotham
doaj +1 more source
Proper Rainbow Connection Number of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct colours. An edge-coloured graph is said to be rainbow connected if any two distinct vertices of the graph are connected by a rainbow path.
Doan Trung Duy, Schiermeyer Ingo
doaj +1 more source
Note On The Game Colouring Number Of Powers Of Graphs
Discussiones Mathematicae Graph Theory, 2016 We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m ≥ 3, which rely on the maximum degree and the ...
Andres Stephan Dominique, Theuser Andrea
doaj +1 more source