Results 1 to 10 of about 5,792 (140)
Coloring Delaunay-edges and their generalizations [PDF]
Computational Geometry, 2021 We consider geometric hypergraphs whose vertex set is a finite set of points (e.g., in the plane), and whose hyperedges are the intersections of this set with a family of geometric regions (e.g., axis-parallel rectangles). A typical coloring problem for such geometric hypergraphs asks, given an integer $k$, for the existence of an integer $m=m(k ...
Eyal Ackerman +2 more
openaire +4 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
Some Remarks on Odd Edge Colorings of Digraphs
Mathematics, 2021 The principal aim of this article is to initiate a study of the following coloring notion for digraphs. An odd k-edge coloring of a general digraph (directed pseudograph) D is a (not necessarily proper) coloring of its edges with at most k colors such ...
Mirko Petruševski, Riste Škrekovski
doaj +1 more source
Adjacent Vertex Distinguishing Coloring of Fuzzy Graphs
Mathematics, 2023 In this paper, we consider the adjacent vertex distinguishing proper edge coloring (for short, AVDPEC) and the adjacent vertex distinguishing total coloring (for short, AVDTC) of a fuzzy graph.
Zengtai Gong, Chen Zhang
doaj +1 more source
Strong Edge Coloring of Generalized Petersen Graphs [PDF]
Mathematics, 2020 A strong edge coloring of a graph G is a proper edge coloring such that every color class is an induced matching. In 2018, Yang and Wu proposed a conjecture that every generalized Petersen graph P(n,k) with k≥4 and n>2k can be strong edge colored with (at most) seven colors.
Chen, Ming, Miao, Lianying, Zhou, Shan
openaire +2 more sources
List star edge coloring of generalized Halin graphs
Discrete Mathematics, 2023 A star $k$-edge coloring is a proper edge coloring such that there are no bichromatic paths or cycles of length four. The smallest integer $k$ such that $G$ admits a star $k$-edge coloring is the star chromatic index of $G$. Deng \etal \cite{MR2933839}, and Bezegov{á} \etal \cite{MR3431294} independently proved that the star chromatic index of a tree ...
Zhengke Miao +3 more
openaire +2 more sources
Generalized Edge Coloring for Channel Assignment in Wireless Networks [PDF]
2006 International Conference on Parallel Processing (ICPP'06), 2006 This paper introduces a new graph theory problem called generalized edge coloring (g.e.c.). A generalized edge coloring is similar to traditional edge coloring, with the difference that a vertex can be adjacent to up to k edges that share the same color. The concept of generalized edge coloring can be used to formulate the channel assignment problem in
Chun-Chen Hsu +3 more
openaire +1 more source
Injective edge coloring of generalized Petersen graphs
AIMS Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yanyi Li, Lily Chen
openaire +2 more sources
An Improved Upper Bound on Neighbor Expanded Sum Distinguishing Index
Discussiones Mathematicae Graph Theory, 2020 A total k-weighting f of a graph G is an assignment of integers from the set {1, . . . , k} to the vertices and edges of G. We say that f is neighbor expanded sum distinguishing, or NESD for short, if Σw∈N(v) (f(vw) + f(w)) differs from Σw∈N(u)(f(uw) + f(
Vučković Bojan
doaj +1 more source
Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs [PDF]
Transactions on Combinatorics, 2017 Let $G$ be a graph and $chi^{prime}_{aa}(G)$ denotes the minimum number of colors required for an acyclic edge coloring of $G$ in which no two adjacent vertices are incident to edges colored with the same set of colors. We prove a general bound for $
Fatemeh Sadat Mousavi, Massomeh Noori
doaj +1 more source