Results 1 to 10 of about 6,300 (231)
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 +3 more sources
Coloring Fuzzy Circular Interval Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Friedrich Eisenbrand
exaly +3 more sources
List circular coloring of trees and cycles [PDF]
Journal of Graph Theory, 2007 AbstractSuppose G=(V, E) is a graph and p ≥ 2q are positive integers. A (p, q)‐coloring of G is a mapping ϕ: V → {0, 1, …, p‐1} such that for any edge xy of G, q ≤ |ϕ(x)‐ϕ(y)| ≤ p‐q. A color‐list is a mapping L: V → $\cal P$({0, 1, …, p‐1}) which assigns to each vertex v a set L(v) of permissible colors. An L‐(p, q)‐coloring of G is a (p, q)‐coloring ϕ
Xuding Zhu
exaly +2 more sources
Generalized Fractional and Circular Total Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2015 Let P and Q be additive and hereditary graph properties, r, s ∈ N, r ≥ s, and [ℤr]s be the set of all s-element subsets of ℤr. An (r, s)-fractional (P,Q)-total coloring of G is an assignment h : V (G) ∪ E(G) → [ℤr]s such that for each i ∈ ℤr the ...
Kemnitz Arnfried +4 more
doaj +3 more sources
Circular coloring and Mycielski construction
Discrete Mathematics, 2010 In this paper, we investigate circular chromatic number of Mycielski construction of graphs. It was shown in \cite{MR2279672} that $t^{\rm th}$ Mycielskian of the Kneser graph $KG(m,n)$ has the same circular chromatic number and chromatic number provided that $m+t$ is an even integer.
Meysam Alishahi +1 more
exaly +3 more sources
On t-Relaxed 2-Distant Circular Coloring of Graphs [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2020 Let $k$ be an positive integer. For any two integers $i$ and $j$ in $\{0,1,\dots,k-1\}$, let $|i-j|_k=\min\{|i-j|,k-|i-j|\}$ be the circular distance between $i$ and $j$. Let $t$ be a nonnegative integer. Suppose $f$ is a mapping from $V(G)$ to $\{0,1,\dots,k-1\}$.
Wensong Lin, Lin Wensong
exaly +3 more sources
Clique-Coloring Circular-Arc Graphs
Electronic Notes in Discrete Mathematics, 2009 Abstract A clique-coloring of a graph is a coloring of its vertices such that no maximal clique of size at least two is monochromatic. A circular-arc graph is the intersection graph of a family of arcs in a circle. We show that every circular-arc graph is 3-clique-colorable.
Marcia R Cerioli
exaly +2 more sources
The value-added challenge of nuts: antioxidant components, functions and applications in nut by-products [PDF]
Frontiers in NutritionObjectiveLarge quantities of nut processing by products are generated worldwide and remain underutilized despite being rich sources of bioactive compounds.
Yingqian Zhou +9 more
doaj +2 more sources
A note on compact and compact circular edge-colorings of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In the paper we study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models.
Dariusz Dereniowski, Adam Nadolski
doaj +5 more sources
Biotechnological production of natural pigments for textile dyeing [PDF]
Frontiers in MicrobiologyGlobal markets, including the pigments sector, have been significantly influenced by the adoption of novel circular bioeconomy policies and increasing concerns about sustainable practices.
Bruna Basto +6 more
doaj +2 more sources