Results 71 to 80 of about 5,252 (152)

Two Upper Bounds for the Strong Edge Chromatic Number

open access: yes
A proper edge coloring c of a graph G is called a k-strong edge coloring, if for every two distinct vertices u and v of G with distances less than or equal to k, the set of the colors appear in the adjacent edges of these two vertices are not equal ...
Mahya Ghandehari, Hamed Hatami
core  

Bayesian phylodynamic inference of population dynamics with dormancy. [PDF]

open access: yesProc Natl Acad Sci U S A
Cappello L   +8 more
europepmc   +1 more source

On the Size of Chromatic Delaunay Mosaics. [PDF]

open access: yesDiscrete Comput Geom
Biswas R   +4 more
europepmc   +1 more source

Enhancement of LTE and NR systems through efficient physical cell identity allocation. [PDF]

open access: yesSci Rep
Farghaly SI   +8 more
europepmc   +1 more source

Graph coloring under constraints

open access: yes, 2011
Dans cette thèse, nous nous intéressons à différentes notions de colorations sous contraintes. Nous nous intéressons plus spécialement à la coloration acyclique, à la coloration forte d'arêtes et à la coloration d'arêtes sommets adjacents distinguants ...
Hocquard, Hervé
core  

Home - About - Disclaimer - Privacy