Results 21 to 30 of about 1,522,114 (310)
Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Let $G$ be a graph and $\mathcal{S}$ be a subset of $Z$. A vertex-coloring $\mathcal{S}$-edge-weighting of $G$ is an assignment of weights by the elements of $\mathcal{S}$ to each edge of $G$ so that adjacent vertices have different sums of incident ...
Hongliang Lu
doaj +1 more source
Injective edge coloring of generalized Petersen graphs
AIMS Mathematics, 2021 Three edges $ e_1 $, $ e_2 $ and $ e_3 $ in a graph $ G $ are $ consecutive $ if they form a cycle of length $ 3 $ or a path in this order. A $ k $-$ injective\; edge\; coloring $ of a graph $ G $ is an edge coloring of $ G $, (not necessarily proper ...
Yanyi Li, Lily Chen
semanticscholar +1 more source
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta [PDF]
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2020 The problem of coloring the edges of an n-node graph of maximum degree Δ with 2Δ − 1 colors is one of the key symmetry breaking problems in the area of distributed graph algorithms. While there has been a lot of progress towards the understanding of this
Alkida Balliu, F. Kuhn, Dennis Olivetti
semanticscholar +1 more source
Edge-Coloring Bipartite Graphs [PDF]
Journal of Algorithms, 2000 This note provides an algorithm for finding \(\Delta\)(colors)-edge-coloring of a bipartite graph of order \(n\) and size \(m\) in time \(T+O(m\log \Delta)\) where \(T\) is the time needed to find a perfect matching in a \(k\)-regular bipartite graph, \(k\leq \Delta\), and \(\Delta\) is the maximum degree of vertices.
A. Kapoor, Rizzi, Romeo
openaire +3 more sources
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.
Li, Ruonan +2 more
openaire +2 more sources
Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 For planar graphs, we consider the problems of list edge coloring and list total coloring. Edge coloring is the problem of coloring the edges while ensuring that two edges that are adjacent receive different colors.
Marthe Bonamy +2 more
doaj +1 more source
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
Online Edge Coloring Is (Nearly) as Easy as Offline [PDF]
Symposium on the Theory of ComputingThe classic theorem of Vizing (Diskret. Analiz.’64) asserts that any graph of maximum degree Δ can be edge colored (offline) using no more than Δ+1 colors (with Δ being a trivial lower bound).
Joakim Blikstad +3 more
semanticscholar +1 more source
Journal of Combinatorial Theory, Series B, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Balister, P.N. +3 more
openaire +2 more sources
Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs [PDF]
Journal of Graph Theory, 2019 AbstractIt is conjectured that every edge‐colored complete graph on vertices satisfying contains vertex‐disjoint properly edge‐colored cycles. We confirm this conjecture for , prove several additional weaker results for general , and we establish structural properties of possible minimum counterexamples to the conjecture.
Ruonan Li, Hajo Broersma, Shenggui Zhang
openaire +3 more sources