Results 31 to 40 of about 1,522,114 (310)

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

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

Tight Bounds for Online Edge Coloring [PDF]

IEEE Annual Symposium on Foundations of Computer Science, 2019
Vizing's celebrated theorem asserts that any graph of maximum degree Δ admits an edge coloring using at most Δ+1 colors. In contrast, Bar-Noy, Motwani and Naor showed over a quarter century ago that the trivial greedy algorithm, which uses 2Δ-1 colors ...
I. Cohen, Binghui Peng, David Wajc
semanticscholar   +1 more source

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

Nonrepetitive edge-colorings of trees [PDF]

Discrete Mathematics & Theoretical Computer Science, 2017
A repetition is a sequence of symbols in which the first half is the same as the second half. An edge-coloring of a graph is repetition-free or nonrepetitive if there is no path with a color pattern that is a repetition.
A. Kündgen, T. Talbot
doaj   +1 more source

A structural approach to the graceful coloring of a subclass of trees

Heliyon, 2023
Let M={1,2,..m} and G be a simple graph. A graceful m-coloring of G is a proper vertex coloring of G using the colors in M which leads to a proper edge coloring using M∖{m} colors such that the associated color of each edge is the absolute difference ...
Laavanya D, Devi Yamini S
doaj   +1 more source

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

Improved Bounds for Some Facially Constrained Colorings

Discussiones Mathematicae Graph Theory, 2023
A facial-parity edge-coloring of a 2-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd number of edges of each color. A facial-parity vertex-coloring of a 2-connected plane graph is a proper
Štorgel Kenny
doaj   +1 more source

Grünbaum colorings extended to non-facial 3-cycles

Electronic Journal of Graph Theory and Applications, 2022
We consider the question of when a triangulation with a Grünbaum coloring can be edge-colored with three colors such that the non-facial 3-cycles also receive all three colors; we will call this a strong Grünbaum coloring.
sarah-marie belcastro, Ruth Haas
doaj   +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