Results 11 to 20 of about 1,425,497 (376)
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 +5 more sources
Deterministic distributed edge-coloring with fewer colors [PDF]
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2017 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 Δ=Ω(logn). For smaller Δ, we give a polylogarithmic-time 3Δ/2-edge-coloring.
M. Ghaffari +3 more
semanticscholar +6 more sources
On restricted edge-colorings of bicliques [PDF]
Discrete Mathematics, 2002 For graphs \(G\) and \(H\) and integers \(q \leq q'\), an \((H; q, q')\)-coloring of \(G\) is an edge coloring of \(G\) such that every copy of \(H\) in \(G\) receives at least \(q\) colors and at most \(q'\) colors. The maximum number and minimum number of colors in an \((H; q, q')\)-coloring of \(G\) is denoted by \(r(G, H: q, q')\) and \(R(G, H: q ...
Dhruv Mubayi, Douglas B. West
openalex +3 more sources
Improved edge-coloring with three colors
Theoretical Computer Science, 2009 AbstractWe show an O(1.344n)=O(20.427n) algorithm for edge-coloring an n-vertex graph using three colors. Our algorithm uses polynomial space. This improves over the previous O(2n/2) algorithm of Beigel and Eppstein [R. Beigel, D. Eppstein, 3-coloring in time O(1.3289n), J. Algorithms 54 (2) (2005) 168–204.].
Łukasz Kowalik
openalex +3 more sources
Online edge coloring via tree recurrences and correlation decay [PDF]
Symposium on the Theory of Computing, 2021 We give an online algorithm that with high probability computes a (e/e−1 + o(1))Δ edge coloring on a graph G with maximum degree Δ = ω(logn) under online edge arrivals against oblivious adversaries, making first progress on the conjecture of Bar-Noy ...
Janardhan Kulkarni +4 more
semanticscholar +1 more source
On Colorful Edge Triples in Edge-Colored Complete Graphs [PDF]
Graphs and Combinatorics, 2020 AbstractAn edge-coloring of the complete graph $$K_n$$ K n we call F-caring if it leaves no F-subgraph of $$K_n$$ K n monochromatic and at the same time every subset of |V(F)| vertices contains in it at least one completely multicolored version of F. For the first two meaningful cases, when $$F=K_{1,3}$$ F = K 1 , 3 and $$F=P_4$$ F = P 4
Gábor Simonyi, Gábor Simonyi
openaire +3 more sources
Local edge (a, d) –antimagic coloring on sunflower, umbrella graph and its application
Alifmatika, 2023 Suppose a graph G = (V, E) is a simple, connected and finite graph with vertex set V(G) and an edge set E(G). The local edge antimagic coloring is a combination of local antimagic labelling and edge coloring.
Robiatul Adawiyah +2 more
doaj +1 more source
Edge Coloring Of Complement Bipolar Fuzzy Graphs
Ratio Mathematica, 2023 : Graph coloring is one of the most important problems of combinatorial optimization. Many problems of practical interest can be modeled as coloring problems.
S. Yahya Mohamed, Subashini N
doaj +1 more source
From Edge-Coloring to Strong Edge-Coloring [PDF]
The Electronic Journal of Combinatorics, 2015 In this paper we study a generalization of both proper edge-coloring and strong edge-coloring: $k$-intersection edge-coloring, introduced by Muthu, Narayanan and Subramanian. In this coloring, the set $S(v)$ of colors used by edges incident to a vertex $v$ does not intersect $S(u)$ on more than $k$ colors when $u$ and $v$ are adjacent.
Borozan, Valentin +6 more
openaire +3 more sources
Neighbor Distinguishing Colorings of Graphs with the Restriction for Maximum Average Degree
Axioms, 2023 Neighbor distinguishing colorings of graphs represent powerful tools for solving the channel assignment problem in wireless communication networks. They consist of two forms of coloring: neighbor distinguishing edge coloring, and neighbor distinguishing ...
Jingjing Huo +3 more
doaj +1 more source