Results 41 to 50 of about 3,659,008 (292)
Electronic Notes in Discrete Mathematics, 2013 Abstract A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to a vertex in each other color class. The b-chromatic number of G is the maximum integer χ b ( G ) for which G has a b-coloring with χ b ( G ) colors.
Carlos Vinícius G. C. Lima +4 more
openaire +3 more sources
Strong chromatic index of k-degenerate graphs [PDF]
, 2015 A {\em strong edge coloring} of a graph $G$ is a proper edge coloring in which every color class is an induced matching. The {\em strong chromatic index} $\chiup_{s}'(G)$ of a graph $G$ is the minimum number of colors in a strong edge coloring of $G$. In
Wang, Tao
core +1 more source
Franck-Delaplace/Chromatic-Community-Structure: Version 1.19
, 2023 Chromatic Community Structure Analysis ...
Franck Delaplace
core +1 more source
Chromatic index critical graphs of order 9. [PDF]
, 1983 We prove that a 2-connected graph of order 9 having maximum valency Δ 4 is chromatic index critical if and only if its valency-list is one of the following: 248, 3247 (except one graph), 258, 3457, 4356, 268, 3567, 4267, 45266, 5465, 278, 3677, 4577 ...
Chetwynd, Amanda G., Yap, H. P.
core +5 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 +1 more source
High-speed chromatic dispersion monitoring of a two-channel WDM system using a single TPA microcavity [PDF]
, 2008 Chromatic dispersion monitoring of two 160 Gb/s wavelength channels using a TPA Microcavity is presented. As the microcavity exhibits a wavelength resonance characteristic, a single device could monitor a number of different WDM-channels ...
Guo, Wei Hua +7 more
core +2 more sources
Franck-Delaplace/Chromatic-Community-Structure: Version 1.15
, 2023 Chromatic Community Structure Analysis ...
Franck Delaplace
core +1 more source
Asymptotics of the Chromatic Index for Multigraphs
Journal of Combinatorial Theory, Series B, 1996 For a multigraph \(G\), let \(D(G)\) denote maximum degree and set \[ \Gamma(G)=\max\Biggl\{{|E(W)|\over \lfloor|W|/2\rfloor}: W\subseteq V, 3\leq |W|\equiv 1\pmod 2\Biggr\}. \] We show that the chromatic index \(\chi'(G)\) is asymptotically \(\max\{D(G),\Gamma(G)\}\). The latter is, by a theorem of \textit{J. Edmonds} [J. Res. Nat. Bur.
openaire +2 more sources
On the chromatic index of Latin squares
Contributions to Discrete Mathematics, 2016 A proper coloring of a Latin square of order n is an assignment of colors to its elements triples such that each row, column and symbol is assigned n distinct colors. Equivalently, a proper coloring of a Latin square is a partition into partial transversals.
Nicholas J. Cavenagh, Jaromy Kuhl
openaire +2 more sources
The Circular Chromatic Index of Flower Snarks [PDF]
The Electronic Journal of Combinatorics, 2006 We determine the circular chromatic index of flower snarks, by showing that $\chi'_c(F_{3})=7/2$, $\chi'_c(F_{5})=17/5$ and $\chi'_c(F_{k})=10/3$ for every odd integer $k\ge 7$, where $F_k$ denotes the flower snark on $4k$ vertices.
Mohammad Ghebleh +3 more
openaire +3 more sources