Results 271 to 280 of about 58,831 (310)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Edge-partition and star chromatic index
Applied Mathematics and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Yiqiao, Wang, Weifan, Wang, Ying
openaire +3 more sources
Conflict‐free chromatic number versus conflict‐free chromatic index
Journal of Graph Theory, 2021AbstractA vertex coloring of a given graph is conflict‐free if the closed neighborhood of every vertex contains a unique color (i.e., a color appearing only once in the neighborhood). The minimum number of colors in such a coloring is the conflict‐free chromatic number of , denoted .
Dębski, Michał, Przybyło, Jakub
openaire +1 more source
Strong Chromatic Index of Sparse Graphs
Journal of Graph Theory, 2015AbstractA 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 , is the least number of colors in a strong edge coloring of G. Chang and Narayanan (J Graph Theory 73(2) (2013), 119–126) proved recently that for a 2‐degenerate graph G.
Yang, Daqing, Zhu, Xuding
openaire +2 more sources
Chromatic index of simple hypergraphs
Discrete Mathematics, 2020The authors consider the problem of edge coloring of simple hypergraphs. There is a very well-known conjecture given independly by \textit{C. Berge} [in: Combinatorial mathematics, Proc. 3rd Int. Conf., New York/ NY (USA) 1985, Ann. N. Y. Acad. Sci. 555, 40--44 (1989; Zbl 0726.05055)] and \textit{Z. Füredi} [Graphs Comb. 2, 89--92 (1986; Zbl 0589.05036)
Guo-Hui Zhang, Brett Skinner
openaire +1 more source
On the coequal values of total chromatic number and chromatic index
Journal of Combinatorial Theory, Series B, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guantao Chen, Yanli Hao
openaire +1 more source
Game chromatic index ofk-degenerate graphs
Journal of Graph Theory, 2001The game chromatic index of a graph \(G\) is the minimum number of colors for which the first player has a winning strategy in the following game. Alternatingly, the players select an edge and color it with a color, different from colors already given to incident edges. The first player wins when the entire graph is colored.
Cai, Leizhen, Zhu, Xuding
openaire +2 more sources
The mod k $k$ chromatic index of random graphs
Journal of Graph Theory, 2021AbstractThe mod chromatic index of a graph is the minimum number of colors needed to color the edges of in a way that the subgraph spanned by the edges of each color has all degrees congruent to . Recently, the authors proved that the mod chromatic index of every graph is at most , improving, for large , a result of Scott.
Fábio Botler +2 more
openaire +1 more source

