Results 271 to 280 of about 641,529 (298)

Maximal Edge-Colorings of Graphs

Graphs and Combinatorics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mariusz Meszka, Magdalena Tyniec
openaire   +2 more sources

Acyclic edge coloring of subcubic graphs [PDF]

Discrete Mathematics, 2008
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and it is denoted by a′(G).
Chandran, Sunil L, Basavaraju, Manu
exaly   +6 more sources

Edge Colorings of Embedded Graphs

Graphs and Combinatorics, 2000
The authors give some conditions for a graph to be embeddable in a surface with Eulerian negative characteristic and to have as chromatic index the maximum degree of its vertices.
Yan, Zhongde, Zhao, Yue
openaire   +2 more sources

A bibliographic survey of edge‐colorings

Journal of Graph Theory, 1978
AbstractThis paper presents a bibliography on edge‐colorings of graphs which is as complete as possible to date. We introduce the papers by a brief discussion of the ideas involved.
openaire   +1 more source

Graph Edge Coloring: A Survey

Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao 0001, Guantao Chen, Guangming Jing, Michael Stiebitz, Bjarne Toft   +4 more
openaire   +1 more source

Edge coloring of signed graphs

Discrete Applied Mathematics, 2020
A signed graph \((G,\sigma)\) is a graph \(G\) with a signature \(\sigma:E(G)\to\{+1,-1\},\) where \(G\) is the underlying graph of \((G,\sigma)\). \textit{T. Zaslavsky} [Discrete Math. 39, 215--228 (1982; Zbl 0487.05027)] started the study of vertex coloring of signed graphs which is to color all vertices of a signed graph \((G,\sigma)\) by a mapping \
Li Zhang, You Lu 0002, Rong Luo, Dong Ye 0002, Shenggui Zhang   +4 more
openaire   +2 more sources

PARALLEL EDGE COLORING APPROXIMATION

Parallel Processing Letters, 1996
Let G be a graph with n vertices and m edges and let its maximum degree be Δ. It is shown that a valid edge coloring of G using at most 2Δ−1 colors can be computed in O( log n log Δ) time using O(m+n) processors on a CREW PRAM. Based on this, for any constant c>1, a valid edge coloring for G using at most max([cΔ], Δ+1) colors can be computed in O(
Martin Fürer, Balaji Raghavachari
openaire   +1 more source

Graph Edge Coloring and Extensions of Edge Colorings

This dissertation explores two main questions which may be framed in terms of graph edge-coloring. First, an assignment of $k$ colors to the edges of the complete bipartite graph $K_{n,n}$ corresponds to an assignment of $k$ symbols to the cells of an $n\times n$ array.
openaire   +1 more source

Note on injective edge-coloring of graphs

Discrete Applied Mathematics, 2022
Gexin Yu, Song Yimin, Zhengke Miao
exaly  

Injective Edge Coloring for Graphs with Small Edge Weight

Graphs and Combinatorics, 2022
Huiqing Liu, Xiaolan Hu, Liu Huiqing
exaly