Results 11 to 20 of about 10,769 (289)
A generalization of chromatic index [PDF]
Discrete Mathematics, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Sampathkumar 0001, G. D. Kamath
openaire +3 more sources
Arboricity and span in fuzzy chromatic index [PDF]
Ratio Mathematica, 2022 A fuzzy matching is a set of edges in which an edge does not incident on a vertex with same membership value. If every vertex of fuzzy graph is M-Plunged then the fuzzy matching is called as fair fuzzy matching.
S. Yahya Mohamed, S. Suganthy
doaj +3 more sources
The circular chromatic index [PDF]
Discrete Mathematics, 2004 Given positive integers \(k,d,\;k \geq 2d\), a \((k,d)\)-edge coloring of a graph \(G\) is a mapping \(c:\;E(G) \to \{0,1,\dots, k-1\}\) such that \(d \leq | c(e_i) - c(e_j)| \leq k-d\) whenever two edges \(e_i,e_j\) are adjacent. The authors introduce the circular chromatic index \(\chi_c'(G)\) defined as \(\chi_c'(G) = \inf\{\frac{k}{d}:\;G\) has a \(
Andrea Hackmann, Arnfried Kemnitz
openaire +3 more sources
On the chromatic index of Latin squares [PDF]
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 +3 more sources
Acyclic chromatic index of chordless graphs [PDF]
Discrete Mathematics, 2023 An acyclic edge coloring of a graph is a proper edge coloring in which there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $a'(G)$, is the minimum positive integer $k$ such that $G$ has an acyclic edge coloring with $k$ colors.
Manu Basavaraju +2 more
openaire +3 more sources
Asymptotics of the Chromatic Index for Multigraphs [PDF]
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.
Kahn, Jeff
openaire +3 more sources
The List Chromatic Index of a Bipartite Multigraph [PDF]
Journal of Combinatorial Theory, Series B, 1995 The list chromatic index of a multigraph is the least number \(n\) for which the edges can be coloured so that adjacent edges get different colours, the colour of each edge being chosen from an arbitrarily prescribed list of \(n\) different colours associated with that edge.
Galvin, F.
openaire +2 more sources
Construction and analysis of graph models for multiprocessor interconnection networks [PDF]
Yugoslav Journal of Operations Research, 2022 A graph G can serve as a model for the Multiprocessor Interconnection Networks (MINs) in which the vertices represent the processors, while the edges represent connections between processors.
Hegde S.M., Saumya Y.M.
doaj +1 more source
From light edges to strong edge-colouring of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$.
Julien Bensmail +3 more
doaj +1 more source
On the Chromatic Index of the Signed Generalized Petersen Graph GP(n,2)
Axioms, 2022 Let G be a graph and σ:E(G)→{+1,−1} be a mapping. The pair (G,σ), denoted by Gσ, is called a signed graph. A (proper) l-edge coloring γ of Gσ is a mapping from each vertex–edge incidence of Gσ to Mq such that γ(v,e)=−σ(e)γ(w,e) for each edge e=vw, and no
Shanshan Zheng +3 more
doaj +1 more source