Results 31 to 40 of about 1,425,497 (376)
AVD edge-colorings of cubic Halin graphs
AIMS Mathematics, 2023 The adjacent vertex-distinguishing edge-coloring of a graph $ G $ is a proper edge-coloring of $ G $ such that each pair of adjacent vetices receives a distinct set of colors.
Ningge Huang , Lily Chen
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 +2 more sources
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 ...
Dömötör Pálvölgyi +3 more
openaire +4 more sources
Dynamic Algorithms for Graph Coloring [PDF]
, 2017 We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for $(\Delta+1)$- vertex coloring and $(2\Delta-1)$-edge coloring ...
Bhattacharya, Sayan +3 more
core +2 more sources
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Kochol +2 more
openaire +2 more sources
Journal of Combinatorial Theory, Series B, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Balister +3 more
openaire +3 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
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
Acyclic edge-coloring using entropy compression [PDF]
, 2013 An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-coloring with at most 4 Delta - 4 colors, improving the ...
Aline Parreau +14 more
core +3 more sources
On star and biclique edge‐colorings [PDF]
International Transactions in Operational Research, 2016 AbstractA biclique of G is a maximal set of vertices that induces a complete bipartite subgraph of G with at least one edge, and a star of a graph G is a maximal set of vertices that induces a complete bipartite graph . A biclique (resp. star) edge‐coloring is a coloring of the edges of a graph with no monochromatic bicliques (resp. stars).
André Luiz Pires Guedes +6 more
openaire +4 more sources