Results 11 to 20 of about 3,659,008 (292)
A Generalization of Chromatic Index [PDF]
Discrete Mathematics, 1994 Let G = (V, E) be a graph and k greater than or equal to 2 an integer. The general chromatic index X(k)' (G) of G is the minimum order of a partition P of E such that for any set F in P every component in the subgraph F] induced by F has size at most k -
Kamath, G.D., Sampathkumar, E.
core +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
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 +6 more sources
Star multigraphs with three vertices of maximum degree. [PDF]
, 1986 The graphs we consider here are either simple graphs, that is they have no loops or multiple edges, or are multigraphs, that is they may have more than one edge joining a pair of vertices, but again have no loops.
Hilton, A. J. W., Chetwynd, Amanda G.
core +4 more sources
On the inclusion chromatic index of a graph [PDF]
Journal of Graph Theory, 2020 AbstractLet be the least number of colours necessary to properly colour the edges of a graph with minimum degree so that the set of colours incident with any vertex is not contained in a set of colours incident to any of its neighbours. We provide an infinite family of examples of graphs with , where is the maximum degree of , and we conjecture ...
Jakub Przybylo, Jakub Kwasny
openaire +1 more source
Mixed Graph Colorings: A Historical Review
Mathematics, 2020 This paper presents a historical review and recent developments in mixed graph colorings in the light of scheduling problems with the makespan criterion. A mixed graph contains both a set of arcs and a set of edges. Two types of colorings of the vertices
Yuri N. Sotskov
doaj +1 more source
Acyclic Chromatic Index of 1-Planar Graphs
Mathematics, 2022 The acyclic chromatic index χa′(G) of a graph G is the smallest k for which G is a proper edge colorable using k colors. A 1-planar graph is a graph that can be drawn in plane such that every edge is crossed by at most one other edge.
Wanshun Yang +5 more
doaj +1 more source
On the chromatic index of generalized truncations
Ars Mathematica Contemporanea, 2022 We examine the chromatic index of generalized truncations of graphs and multigraphs.
Alspach, Brian, Joshi, Aditya
openaire +2 more sources
Approximating the chromatic index of multigraphs [PDF]
Journal of Combinatorial Optimization, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zang, W, Chen, G, Yu, X
openaire +4 more sources