Results 41 to 50 of about 4,256 (307)
Colourings of graphs by labellings
Electronic Notes in Discrete Mathematics, 2017 Abstract In this paper we give a survey on several types of colourings of elements of graphs by different types of labellings.
Martin Baca, Stanislav Jendrol'
openaire +1 more source
On the Complexity of Colouring Antiprismatic Graphs [PDF]
Algorithmica, 2020 A graph G is prismatic if for every triangle T of G, every vertex of G not in T has a unique neighbour in T. The complement of a prismatic graph is called \emph{antiprismatic}. The complexity of colouring antiprismatic graphs is still unknown. Equivalently, the complexity of the clique cover problem in prismatic graphs is not known.
Preissmann, Myriam +2 more
openaire +5 more sources
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe Grundy number of a graph is the maximum number of colours used by the "First-Fit" greedy colouring algorithm over all vertex orderings. Given a vertex ordering $\sigma= v_1,\dots,v_n$, the "First-Fit" greedy colouring algorithm ...
Laurent Beaudou +6 more
doaj +1 more source
The Complexity of 3-Colouring H-Colourable Graphs [PDF]
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019 We study the complexity of approximation on satisfiable instances for graph homomorphism problems. For a fixed graph $H$, the $H$-colouring problem is to decide whether a given graph has a homomorphism to $H$. By a result of Hell and Nešetřil, this problem is NP-hard for any non-bipartite graph $H$.
Andrei A. Krokhin, Jakub Oprsal
openaire +4 more sources
Delay Colouring in Quartic Graphs [PDF]
The Electronic Journal of Combinatorics, 2020 Haxell, Wilfong, and Winkler conjectured that every bipartite graph with maximum degree $\Delta$ is $(\Delta + 1)$-delay-colourable. We prove this conjecture in the special case $\Delta = 4$.
Katherine Edwards, W. Sean Kennedy
openaire +1 more source
Anagram-free Graph Colouring and Colour Schemes [PDF]
, 2019 Graphs model the connectivity of networks, and many researchers study how to colour the nodes of a graph under various restrictions. Anagram-free colouring is a type of graph colouring which requires the first half of every path through a graph to not be
TIMOTHY EDWARD WILSON (6395219)
core +1 more source
Bilangan Kromatik Grap Commuting dan Non Commuting Grup Dihedral
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2015 Commuting graph is a graph that has a set of points X and two different vertices to be connected directly if each commutative in G. Let G non abelian group and Z(G) is a center of G.
Handrini Rahayuningtyas +2 more
doaj +1 more source
List circular backbone colouring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A natural generalization of graph colouring involves taking colours from a metric space and insisting that the endpoints of an edge receive colours separated by a minimum distance dictated by properties of the edge.
Frederic Havet, Andrew D. King
doaj +1 more source
Bounds On Fuzzy Dominator Chromatic Number of Fuzzy Soft Bipartite Graphs
Ratio Mathematica, 2023 An FSG GS(T,V) fuzzy’s soft dominator colouring (FSDC) is a suitable Fuzzy Soft Colouring (FSC) where every node of a colour group is dominated by a vertex of GS(T,V).
Jahir Hussain R, Afya Farhana M
doaj +1 more source
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source