Results 21 to 30 of about 14,669 (262)

Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems [PDF]

Journal of Parallel and Distributed Computing, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang, Weifa, Shen, Xiaojun, Hu, Qing
openaire   +2 more sources

Dynamic Algorithms for Graph Coloring [PDF]

, 2017
We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for $(\Delta+1)$- vertex coloring and $(2\Delta-1)$-edge coloring ...
Bhattacharya, Sayan, Chakrabarty, Deeparnab, Henzinger, Monika, Nanongkai, Danupon   +3 more
core   +2 more sources

Graphs with coloring redundant edges

Electronic Journal of Graph Theory and Applications, 2016
A graph edge is $d$-coloring redundant if the removal of the edge doesnot change the set of $d$-colorings of the graph. Graphs that are toosparse or too dense do not have coloring redundant edges.
Bart Demoen, Phuong-Lan Nguyen
doaj   +1 more source

Acyclic edge-coloring using entropy compression [PDF]

, 2013
An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-coloring with at most 4 Delta - 4 colors, improving the ...
Aline Parreau, Alon, Alon, Bissacot, Drmota, Fertin, Fiamčik, Flajolet, Grytczuk, Haeupler, Louis Esperet, Marx, Moser, Muthu, Ndreca   +14 more
core   +3 more sources

On facial unique-maximum (edge-)coloring [PDF]

, 2017
A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face $\alpha$ the maximal color appears exactly once on the vertices of $\alpha$.
Andova, Vesna, Lidicky, Bernard, Lidicky, Bernard, Luzar, Borut, Skrekovski, Riste   +4 more
core   +3 more sources

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

Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring [PDF]

, 2019
A valid edge-coloring of a graph is an assignment of "colors" to its edges such that no two incident edges receive the same color. The goal is to find a proper coloring that uses few colors.
Behnezhad, Soheil, Derakhshan, Mahsa, Hajiaghayi, MohammadTaghi, Knittel, Marina, Saleh, Hamed   +4 more
core   +1 more source

Acyclic edge coloring of graphs [PDF]

, 2014
An {\em acyclic edge coloring} of a graph $G$ is a proper edge coloring such that the subgraph induced by any two color classes is a linear forest (an acyclic graph with maximum degree at most two). The {\em acyclic chromatic index} $\chiup_{a}'(G)$ of a
Wang, Tao, Zhang, Yaqiong
core   +1 more source

Edge Colored hypergraphic Arrangements [PDF]

Pure and Applied Mathematics Quarterly, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Facial graceful coloring of plane graphs [PDF]

Opuscula Mathematica
Let \(G\) be a plane graph. Two edges of \(G\) are facially adjacent if they are consecutive on the boundary walk of a face of \(G\). A facial edge coloring of \(G\) is an edge coloring such that any two facially adjacent edges receive different colors ...
Július Czap
doaj   +1 more source