Results 1 to 10 of about 10,769 (289)
Strong chromatic index of products of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 The strong chromatic index of a graph is the minimum number of colours needed to colour the edges in such a way that each colour class is an induced matching.
Olivier Togni
doaj +7 more sources
The game chromatic index of wheels [PDF]
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephan Dominique Andres
exaly +4 more sources
A sublinear bound on the chromatic index of multigraphs [PDF]
Discrete Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Plantholt
exaly +4 more sources
Chromatic index determined by fractional chromatic index [PDF]
Journal of Combinatorial Theory Series B, 2018 21pages
Ringi Kim, Luke Postle, Songling Shan
exaly +3 more sources
A stronger bound for the strong chromatic index [PDF]
Electronic Notes in Discrete Mathematics, 2015 We prove χ′s(G) ≤ 1.93 Δ(G)2 for graphs of sufficiently large maximum degree where χ′s(G) is the strong chromatic index of G. This improves an old bound of Molloy and Reed. As a by-product, we present a Talagrand-type inequality where we are allowed to exclude unlikely bad outcomes that would otherwise render the inequality unusable.
Henning Brühn
exaly +3 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 +3 more sources
On the upper chromatic index of a multigraph [PDF]
Computer Science Journal of Moldova, 2002 We consider the colorings of the edges of a multigraph in such a way that every non-pendant vertex is incident to at least two edges of the same color.
Mario Gionfriddo +2 more
doaj +4 more sources
On the mod $k$ chromatic index of graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceFor a graph $G$ and an integer $k\geq 2$, a $\chi'_{k}$-coloring of $G$ is an edge coloring of $G$ such that the subgraph induced by the edges of each color has all degrees congruent to $1 ~ (\mod k)$, and $\chi'_{k}(G)$ is the minimum number of colors ...
Oothan Nweit, Daqing Yang
doaj +5 more sources
A Note on the Game Chromatic Index of Graphs
Graphs and Combinatorics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jarosław Grytczuk, Tomasz Bartnicki
exaly +4 more sources
Fuzzy coloring and total fuzzy coloring of various types of intuitionistic fuzzy graphs [PDF]
Notes on IFS, 2023 In this paper, fuzzy coloring and total fuzzy coloring of intuitionistic fuzzy graphs are introduced. The fuzzy chromatic number, fuzzy chromatic index, total fuzzy chromatic number and total fuzzy chromatic index of both vertices and edges in ...
R. Buvaneswari, P. Revathy
doaj +1 more source