Results 1 to 10 of about 58,831 (310)
Strong Chromatic Index of Outerplanar Graphs [PDF]
Axioms, 2022 The strong chromatic index χs′(G) of a graph G is the minimum number of colors needed in a proper edge-coloring so that every color class induces a matching in G. It was proved In 2013, that every outerplanar graph G with Δ≥3 has χs′(G)≤3Δ−3.
Ying Wang +3 more
doaj +3 more sources
Color diversity index : the effect of chromatic adaptation [PDF]
, 2011 Common descriptors of light quality fail to predict the chromatic diversity produced by the same illuminant in different contexts. The aim of this paper was to study the influence of the chromatic adaptation in the context of the development of the ...
Linhares, João M. M. +1 more
core +3 more sources
The chromatic index of cyclic Steiner 2-designs [PDF]
International Journal of Mathematics and Mathematical Sciences, 1982 The number of colours needed to colour the blocks of a cyclic Steiner 2-design S(2,k,v) is at most v.
Charles J. Colbourn, Marlene J. Colbourn
doaj +2 more sources
Algorithms for computing chromatic polynomials and chromatic index polynomials
Scientific AfricanObjectives: The aim of this article is to enhance the understanding of the computation of chromatic polynomials and chromatic index polynomials, and to facilitate their practical use in various fields by demonstrating and supporting the proposed ...
Lateram Zawuga Hordofa +2 more
doaj +2 more sources
Note on the game chromatic index of trees [PDF]
, 2002 We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree $\Delta = 3$ is at most $\Delta + 1$.
Erdös, P.L. +3 more
core +2 more sources
A linear-time algorithm for the strong chromatic index of Halin graphs [PDF]
, 2011 We show that there exists a linear-time algorithm that computes the strong chromatic index of Halin graphs.Comment: 7 ...
Kloks, Ton, Wang, Yue-Li
core +3 more sources
Conflict-free chromatic index of trees [PDF]
Theoretical Computer ScienceA graph $G$ is conflict-free $k$-edge-colorable if there exists an assignment of $k$ colors to $E(G)$ such that for every edge $e\in E(G)$, there is a color that is assigned to exactly one edge among the closed neighborhood of $e$. The smallest $k$ such that $G$ is conflict-free $k$-edge-colorable is called the conflict-free chromatic index of $G ...
Shanshan Guo, E. Li, Luyi Li, Ping Li
openalex +3 more sources
On the Star Chromatic Index of Generalized Petersen Graphs
Discussiones Mathematicae Graph Theory, 2021 The star k-edge-coloring of graph G is a proper edge coloring using k colors such that no path or cycle of length four is bichromatic. The minimum number k for which G admits a star k-edge-coloring is called the star chromatic index of G, denoted by χ′s (
Zhu Enqiang, Shao Zehui
doaj +2 more sources
Strong chromatic index of sparse graphs [PDF]
, 2013 A coloring of the edges of a graph $G$ is strong if each color class is an induced matching of $G$. The strong chromatic index of $G$, denoted by $\chi_{s}^{\prime}(G)$, is the least number of colors in a strong edge coloring of $G$.
Dębski, Michał +2 more
core +2 more sources
Results in PhysicsFourth-generation synchrotron light sources generate highly brilliant and coherent electromagnetic radiation, valuable in multiple scientific areas.
Edgar Andrés Sánchez +4 more
doaj +2 more sources