Results 41 to 50 of about 42,715 (280)
A note on face coloring entire weightings of plane graphs
Given a weighting of all elements of a 2-connected plane graph G = (V,E, F), let f(α) denote the sum of the weights of the edges and vertices incident with the face _ and also the weight of _.
Jendrol Stanislav, Šugerek Peter
doaj +1 more source
Colour at edges and colour spreading in McCollough effects
Broerse and O'Shea [(1995) Vision Research, 35, 207-226] proposed that the subjective colours in McCollough effects (MEs) consist of two components: edge colours appearing along the edges of contours, and spread colours radiating from edge colours into adjacent uncontoured regions of test patterns. This proposal was examined in five experiments. First,
Broerse, Jack +2 more
openaire +3 more sources
Chromatic Polynomials of 2-Edge-Coloured Graphs
Using the definition of colouring of $2$-edge-coloured graphs derived from 2-edge-coloured graph homomorphism, we extend the definition of chromatic polynomial to 2-edge-coloured graphs. We find closed forms for the first three coefficients of this polynomial that generalize the known results for the chromatic polynomial of a graph.
Beaton, Iain +3 more
openaire +3 more sources
Partitioning edge-coloured complete graphs into monochromatic cycles and paths
A conjecture of Erd\H{o}s, Gy\'arf\'as, and Pyber says that in any edge-colouring of a complete graph with r colours, it is possible to cover all the vertices with r vertex-disjoint monochromatic cycles. So far, this conjecture has been proven only for r
Alexey Pokrovskiy +10 more
core +1 more source
Mixed graph colouring as scheduling multi-processor tasks with equal processing times
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 +1 more source
Complexity of colouring problems restricted to unichord-free and \{square,unichord\}-free graphs
A \emph{unichord} in a graph is an edge that is the unique chord of a cycle. A \emph{square} is an induced cycle on four vertices. A graph is \emph{unichord-free} if none of its edges is a unichord.
de Figueiredo, Celina M. H. +2 more
core +3 more sources
Total Graph Interpretation of the Numbers of the Fibonacci Type
We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give
Urszula Bednarz +2 more
doaj +1 more source
Edge Colouring of Neutrosophic Graphs and Its Application in Detection of Phishing Website
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 +1 more source
Molecular bases of circadian magnesium rhythms across eukaryotes
Circadian rhythms in intracellular [Mg2+] exist across eukaryotic kingdoms. Central roles for Mg2+ in metabolism suggest that Mg2+ rhythms could regulate daily cellular energy and metabolism. In this Perspective paper, we propose that ancestral prokaryotic transport proteins could be responsible for mediating Mg2+ rhythms and posit a feedback model ...
Helen K. Feord, Gerben van Ooijen
wiley +1 more source
Critical and Flow-Critical Snarks Coincide
Over the past twenty years, critical and bicritical snarks have been appearing in the literature in various forms and in different contexts. Two main variants of criticality of snarks have been studied: criticality with respect to the non-existence of a ...
Máčajová Edita, Škoviera Martin
doaj +1 more source

