Results 71 to 80 of about 27,939 (295)
Game chromatic number of lexicographic product graphs
AKCE International Journal of Graphs and Combinatorics, 2015 In this paper, we determine the exact values of the game chromatic number of lexicographic product of path P2 with path Pn, star K1,n and wheel Wn. Also we give an upper bound for the game chromatic number of lexicographic product of any two simple ...
R. Alagammai, V. Vijayalakshmi
doaj +1 more source
Spectrally Encoded Proximity‐Field Nanopatterning
Advanced Optical Materials, EarlyView.Spectrally encoded proximity‐field nanopatterning (SEPN) enables continuous control of the out‐of‐plane periodicity of 3D photonic crystals by tuning the exposure wavelength while maintaining a fixed in‐plane period. This decouples near‐infrared reflectance from visible iridescence and allows fabrication of integrated multipattern devices with ...
Junhyung Park +6 more
wiley +1 more source
Coloring Some Finite Sets in ℝn
Discussiones Mathematicae Graph Theory, 2013 This note relates to bounds on the chromatic number χ(ℝn) of the Euclidean space, which is the minimum number of colors needed to color all the points in ℝn so that any two points at the distance 1 receive different colors. In [6] a sequence of graphs Gn
Balogh József +2 more
doaj +1 more source
T-Colorings, Divisibility and the Circular Chromatic Number
Discussiones Mathematicae Graph Theory, 2021 Let T be a T -set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T -edge spans espT (G) and espd⊙T(G), where d is a positive integer and d⊙T={0≤t≤d(maxT+1):d|t⇒t/d∈T}.d \odot T =
Janczewski Robert +2 more
doaj +1 more source
The incidence game chromatic number
, 2009 We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph.
Andres, Dominique +1 more
core +1 more source
The chromatic number of heptagraphs
Journal of Graph TheoryAbstractA pentagraph is a graph without cycles of length 3 or 4 and without induced cycles of odd length at least 7, and a heptagraph is one without cycles of length less than 7 and without induced cycles of odd length at least 9. Chudnovsky and Seymour proved that every pentagraph is 3‐colorable.
Di Wu, Baogang Xu, Yian Xu
openaire +2 more sources
A Bound on the Total Chromatic Number [PDF]
COMBINATORICA, 1998 A total colouring of a graph \(G\) is an assignment of colours to its vertices and edges so that no two adjacent edges have the same colour, no two adjacent vertices have the same colour, and no edge has the same colour as one of its endpoints. The total chromatic number \(\chi''(G)\) is the least number of colours required for a total colouring of \(G\
Molloy, M., Reed, B.
openaire +2 more sources
Advanced Optical Materials, EarlyView.Structural color generation is an emerging field for digital display and printing applications. This report presents a novel truncated‐cone design and the first use of GaP sandwiched between two layers of TiO2, demonstrating ultra‐bright, tunable colors with a record color gamut.
Md Rumon Miah +2 more
wiley +1 more source
Chromatic and clique numbers of a class of perfect graphs [PDF]
Transactions on Combinatorics, 2015 Let p be a prime number and n be a positive integer. The graph G p (n) is a graph with vertex set [n]=1,2,ldots,n , in which there is an arc from u to v if and only if uneqv and pnmidu+v . In this paper it is shown that G p (n) is a perfect
Mohammad Reza Fander
doaj
On the difference between chromatic number and dynamic chromatic number of graphs
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arash Ahadi +3 more
openaire +2 more sources