Results 21 to 30 of about 92,019 (279)
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 +3 more
core +2 more sources
Color Invariant Edge Detection [PDF]
, 1999 Segmentation based on color, instead of intensity only, pro- vides an easier distinction between materials, on the condition that ro- bustness against irrelevant parameters is achieved, such as illumination source, shadows, geometry and camera sensitivities.
Geusebroek, J.-M. +5 more
openaire +2 more sources
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 MathematicaLet \(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
, 2016 Locally finding a solution to symmetry-breaking tasks such as vertex-coloring, edge-coloring, maximal matching, maximal independent set, etc., is a long-standing challenge in distributed network computing. More recently, it has also become a challenge in
Fraigniaud, Pierre +2 more
core +4 more sources
Approximate constrained bipartite edge coloring [PDF]
Discrete Applied Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Caragiannis, Ioannis +5 more
openaire +4 more sources
On the Star Chromatic Index of Generalized Petersen Graphs
Discussiones Mathematicae Graph Theory, 2021 The star k-edge-coloring of graph G is a proper edge coloring using k colors such that no path or cycle of length four is bichromatic. The minimum number k for which G admits a star k-edge-coloring is called the star chromatic index of G, denoted by χ′s (
Zhu Enqiang, Shao Zehui
doaj +1 more source