Results 1 to 10 of about 7,346 (146)

New Bounds for the Dichromatic Number of a Digraph [PDF]

open access: diamondDiscrete Mathematics & Theoretical Computer Science, 2019
The chromatic number of a graph $G$, denoted by $\chi(G)$, is the minimum $k$ such that $G$ admits a $k$-coloring of its vertex set in such a way that each color class is an independent set (a set of pairwise non-adjacent vertices).
Narda Cordero-Michel   +1 more
doaj   +5 more sources

On the Complexity of Digraph Colourings and Vertex Arboricity [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
It has been shown by Bokal et al. that deciding 2-colourability of digraphs is an NP-complete problem. This result was later on extended by Feder et al. to prove that deciding whether a digraph has a circular $p$-colouring is NP-complete for all rational
Winfried Hochstättler   +2 more
doaj   +3 more sources

A Note on Graphs of Dichromatic Number 2 [PDF]

open access: diamondDiscrete Mathematics & Theoretical Computer Science, 2021
Neumann-Lara and Škrekovski conjectured that every planar digraph is 2-colourable. We show that this conjecture is equivalent to the more general statement that all oriented K_5-minor-free graphs are 2-colourable.
Raphael Steiner
doaj   +3 more sources

The Star Dichromatic Number

open access: diamondDiscussiones Mathematicae Graph Theory, 2022
We introduce a new notion of circular colourings for digraphs. The idea of this quantity, called star dichromatic number χ→*\vec \chi * (D) of a digraph D, is to allow a finer subdivision of digraphs with the same dichromatic number into such which are ...
Hochstättler Winfried, Steiner Raphael
doaj   +4 more sources

DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER [PDF]

open access: goldForum of Mathematics, Sigma, 2016
The dichromatic number of a graph $G$ is the maximum integer $k$
BOJAN MOHAR, HEHUI WU
doaj   +2 more sources

The Dichromatic Number of Infinite Families of Circulant Tournaments

open access: diamondDiscussiones Mathematicae Graph Theory, 2017
The dichromatic number dc(D) of a digraph D is defined to be the minimum number of colors such that the vertices of D can be colored in such a way that every chromatic class induces an acyclic subdigraph in D.
Javier Nahid, Llano Bernardo
doaj   +2 more sources

Perception and communication of relevant colours in paintings by observers with colour vision deficiencies [PDF]

open access: yesScientific Reports
In a previous work, we empirically analysed the so-called “relevant colours” in paintings. These relevant colours describe the number of colours that stand out for an observer when glancing at a painting.
Juan Luis Nieves   +3 more
doaj   +2 more sources

Enhancing strawberry resilience to saline, alkaline, and combined stresses with light spectra: impacts on growth, enzymatic activity, nutrient uptake, and osmotic regulation [PDF]

open access: yesBMC Plant Biology
Background This study examines the effects of various complementary light spectra on the growth, development, antioxidant activity, and nutrient absorption in strawberry plants under stress conditions.
Mohammad Reza Malekzadeh   +2 more
doaj   +2 more sources

Cold-atom optical filtering enhanced by optical pumping

open access: yesFrontiers in Physics, 2022
Atomic optical filters such as Faraday anomalous dispersion optical filters (FADOFs) or similar technologies can achieve very narrow optical bandwidth close to the scale of atomic linewidth, which can be greatly reduced in cold atoms. However, limited by
Xiaolei Guan   +7 more
doaj   +1 more source

Game-Perfect Semiorientations of Forests

open access: yesDiscussiones Mathematicae Graph Theory, 2022
We consider digraph colouring games where two players, Alice and Bob, alternately colour vertices of a given digraph D with a colour from a given colour set in a feasible way. The game ends when such move is not possible any more.
Andres Stephan Dominique   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy