Results 21 to 30 of about 1,425,497 (376)
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a graph. A local edge coloring of G is a proper edge coloring such that for each subset S of E(G) with there exist edges such that where ns is the number of copies of P3 in the edge induced subgraph The maximum color assigned by a local edge ...
P. Deepa +2 more
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.
Qing Hu, Weifa Liang, Xiaojun Shen
openaire +2 more sources
Online Edge Coloring Algorithms via the Nibble Method [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2020 Nearly thirty years ago, Bar-Noy, Motwani and Naor [IPL'92] conjectured that an online $(1+o(1))\Delta$-edge-coloring algorithm exists for $n$-node graphs of maximum degree $\Delta=\omega(\log n)$.
Sayan Bhattacharya +2 more
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
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
Distinguishing colorings of graphs and their subgraphs
AIMS Mathematics, 2023 In this paper, several distinguishing colorings of graphs are studied, such as vertex distinguishing proper edge coloring, adjacent vertex distinguishing proper edge coloring, vertex distinguishing proper total coloring, adjacent vertex distinguishing ...
Baolin Ma, Chao Yang
doaj +1 more source
Acyclicity in edge-colored graphs [PDF]
Discrete Mathematics, 2017 A walk $W$ in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in $W$ is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type $i$ is a proper superset of graphs of acyclicity of type $i+1$, $i=1,2,3,4.$ The first three types are ...
Bin Sheng +5 more
openaire +3 more sources
Restrained star edge coloring of graphs and its application in optimal & safe storage practices
Ratio Mathematica, 2023 In this paper we introduce the concept of restrained star edge coloring of graphs by restraining the conditions of the star coloring of graphs. The restrained star edge coloring of graphs is a path based graph coloring which is said to be proper if all ...
W. Evangeline Lydia +1 more
doaj +1 more source
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
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