Results 31 to 40 of about 3,659,008 (292)
On the chromatic index of path decompositions
Discrete Mathematics, 2004 Given a decomposition \(D\) of a graph \(H\) into edge-disjoint copies of a graph \(G\), the chromatic index of \(D\) is the minimum number of colours in any colouring of the copies of \(G\) in \(D\) in which no two copies of \(G\) having a vertex in common get the same colour. For given \(H\) and \(G\), the minimum chromatic index problem asks for the
Peter Danziger +2 more
openaire +3 more sources
Chromatic index, treewidth and maximum degree [PDF]
Electronic Notes in Discrete Mathematics, 2016 We conjecture that any graph $G$ with treewidth $k$ and maximum degree $\Delta(G)\geq k + \sqrt{k}$ satisfies $\chi'(G)=\Delta(G)$. In support of the conjecture we prove its fractional version. We also show that any graph $G$ with treewidth $k\geq 4$ and maximum degree $2k-1$ satisfies $\chi'(G)=\Delta(G)$, extending an old result of Vizing.
Henning Bruhn +2 more
openaire +4 more sources
Twin edge colorings of certain square graphs and product graphs
Electronic Journal of Graph Theory and Applications, 2016 A twin edge $k\!$-coloring of a graph $G$ is a proper edge $k$-coloring of $G$ with the elements of $\mathbb{Z}_k$ so that the induced vertex $k$-coloring, in which the color of a vertex $v$ in $G$ is the sum in $\mathbb{Z}_k$ of the colors of the edges ...
R Rajarajachozhan, R. Sampathkumar
doaj +1 more source
AVD proper edge-coloring of some families of graphs
International Journal of Mathematics for Industry, 2021 Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source
Analysis of Chromatic Aberration Effects in Triple-Junction Solar Cells Using Advanced Distributed Models [PDF]
, 2011 The consideration of real operating conditions for the design and optimization of a multijunction solar cell receiver-concentrator assembly is indispensable.
Espinet González, Pilar +8 more
core +1 more source
The Distance-t Chromatic Index of Graphs [PDF]
Combinatorics, Probability and Computing, 2013 We consider two graph colouring problems in which edges at distance at most t are given distinct colours, for some fixed positive integer t. We obtain two upper bounds for the distance-t chromatic index, the least number of colours necessary for such a colouring. One is a bound of (2-ε)Δt for graphs of maximum degree at most Δ, where ε is some absolute
Tomás Kaiser, Ross J. Kang
openaire +3 more sources
A New Proof for a Result on the Inclusion Chromatic Index of Subcubic Graphs
Axioms, 2022 Let G be a graph with a minimum degree δ of at least two. The inclusion chromatic index of G, denoted by χ⊂′(G), is the minimum number of colors needed to properly color the edges of G so that the set of colors incident with any vertex is not contained ...
Lily Chen, Yanyi Li
doaj +1 more source
Franck-Delaplace/Chromatic-Community-Structure: VERSION 1.13
, 2023 Chromatic Community Structure Analysis ...
Franck Delaplace
core +1 more source
Acyclic, Star and Oriented Colourings of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let G be a graph with chromatic number χ (G). A vertex colouring of G is \emphacyclic if each bichromatic subgraph is a forest. A \emphstar colouring of G is an acyclic colouring in which each bichromatic subgraph is a star forest. Let χ _a(G) and χ _s(G)
David R. Wood
doaj +3 more sources
Mode dispersion and delay characteristics of optical waveguides using equivalent TL circuits [PDF]
, 2005 A new analysis leading to an exact and efficient algorithm is presented for calculating directly and without numerical differentiation the mode dispersion characteristics of cylindrical dielectric waveguides of arbitrary refractive-index profile. The new
Boucouvalas, Anthony C. +3 more
core +2 more sources