Results 181 to 190 of about 3,787 (214)

A survey on circular chromatic numbers of graphs

, 2001
openaire   +2 more sources

Polychromatic Virtual Retinal Imaging of Two Extended-Depth-of-Focus Intraocular Lenses. [PDF]

Transl Vis Sci Technol
Mendroch D, Altmeyer S, Oberheide U.
europepmc   +1 more source

The effects of a HEV-filtering contact lens on the brightness of natural images. [PDF]

Ophthalmic Physiol Opt
Hammond BR, Buch JR, Martin P, Shamp W, Harth JB, Wysocky C, Renzi-Hammond LM.   +6 more
europepmc   +1 more source

enGLOW 3D microscopy of the enteric nervous system in cleared human and mouse gut. [PDF]

Commun Biol
Planchette A, Gantar I, Scholler J, Sobolewski A, Cabara Y, Wojcicki K, Brana C, Durand T, Naveilhan P, Barthet G, Neunlist M, Pagès S, Gora MJ.   +12 more
europepmc   +1 more source

Physiological Impact of Chromatic-Weight Illusions in Augmented Reality: A Comparative sEMG Analysis of Muscle Fatigue and Stability. [PDF]

Sensors (Basel)
Wang J, Greenfield J, Mitrouchev P, Li G, Quaine F.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The circular chromatic number of a digraph

Journal of Graph Theory, 2004
AbstractWe introduce the circular chromatic number χc of a digraph and establish various basic results. They show that the coloring theory for digraphs is similar to the coloring theory for undirected graphs when independent sets of vertices are replaced by acyclic sets.
Bojan Mohar
exaly   +3 more sources

The circular chromatic numbers of signed series-parallel graphs

Discrete Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xuding Zhu
exaly   +3 more sources

Fractional chromatic number and circular chromatic number for distance graphs with large clique size

Journal of Graph Theory, 2004
AbstractAn Erratum has been published for this article in Journal of Graph Theory 48: 329–330, 2005.Let M be a set of positive integers. The distance graph generated by M, denoted by G(Z, M), has the set Z of all integers as the vertex set, and edges ij whenever |i−j| ∈ M. We investigate the fractional chromatic number and the circular chromatic number
Xuding Zhu
exaly   +3 more sources

CIRCULAR CHROMATIC NUMBER AND MYCIELSKI GRAPHS

Acta Mathematica Scientia, 2006
Abstract For a general graph G, M(G) denotes its Mycielski graph. This article gives a number of new sufficient conditions for G to have the circular chromatic number χ c ( M(G) ) equals to the chromatic number χ( M(G) ), which have improved some best sufficient conditions published up to date.
exaly   +2 more sources