Results 31 to 40 of about 934,117 (293)
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
Deterministic distributed edge-coloring with fewer colors [PDF]
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018 We present a deterministic distributed algorithm, in the LOCAL model, that computes a $(1+o(1))Δ$-edge-coloring in polylogarithmic-time, so long as the maximum degree $Δ=\tildeΩ(\log n)$. For smaller $Δ$, we give a polylogarithmic-time $3Δ/2$-edge-coloring.
Mohsen Ghaffari 0001 +3 more
openaire +4 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
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
Discrete Mathematics, 1996 The authors investigate the largest fraction of edges in a 3-regular graph that can be colored in 3 colors. They show that this fraction is always at least 13/15 and sometimes at most 25/27. They investigate the analogous problem for graphs of maximum degree 3 and also for 4-regular graphs with 4 colors instead of 3.
Michael O. Albertson, Ruth Haas
openaire +1 more source
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs [PDF]
Graphs and Combinatorics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruonan Li, Hajo Broersma, Shenggui Zhang
openaire +2 more sources
Majority Edge-Colorings of Graphs
The Electronic Journal of Combinatorics, 2023 We propose the notion of a majority $k$-edge-coloring of a graph $G$, which is an edge-coloring of $G$ with $k$ colors such that, for every vertex $u$ of $G$, at most half the edges of $G$ incident with $u$ have the same color. We show the best possible results that every graph of minimum degree at least $2$ has a majority $4$-edge-coloring, and that ...
Felix Bock +5 more
openaire +4 more sources
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
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