Results 201 to 210 of about 58,831 (310)

Situational motionless camouflage of a loliginid squid. [PDF]

open access: yesSci Rep
Nakajima R   +8 more
europepmc   +1 more source

On the Strong Chromatic Index of Sparse Graphs

open access: diamond, 2018
Philip DeOrsey   +9 more
openalex   +1 more source

Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) $\text{fas}(D)$ denote the minimum size of a feedback arc set in an oriented multigraph D $D$. In several papers, upper bounds for fas ( D ) $\text{fas}(D)$ were obtained for oriented multigraphs D $D$ with maximum degree upper‐bounded by a constant ...
Gregory Gutin   +3 more
wiley   +1 more source

On Oriented Colourings of Graphs on Surfaces

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT For an oriented graph G $G$, the least number of colours required to oriented colour G $G$ is called the oriented chromatic number of G $G$ and denoted χ o ( G ) ${\chi }_{o}(G)$. For a non‐negative integer g $g$ let χ o ( g ) ${\chi }_{o}(g)$ be the least integer such that χ o ( G ) ≤ χ o ( g ) ${\chi }_{o}(G)\le \unicode{x0200A}{\chi }_{o}(g)
Alexander Clow
wiley   +1 more source

Chromatic index critical graphs and multigraphs

open access: yes, 2000
We consider graphs and multigraphs which are critical with respect to the chromatic index. In chapter 3, we give a construction of critical multigraphs with exactly 20 vertices and maximum degree k for every k>=5. This disproves the weak critical graph conjecture. In chapter 4, we give a new method, how several 4-critical multigraphs can be constructed
openaire   +1 more source

Fractional List Packing for Layered Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

Home - About - Disclaimer - Privacy