Results 61 to 70 of about 5,252 (152)

Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)

, 2023
We survey work on coloring, list coloring, and painting squares of graphs; in particular, we consider strong edge-coloring. We focus primarily on planar graphs and other sparse classes of graphs.Comment: 32 pages, 13 figures and tables, plus 195-entry ...
Cranston, Daniel W.
core  

Comparing First-Fit and Next-Fit for Online Edge Coloring

, 2009
We study the performance of the algorithms First-Fit and Next-Fit for two online edge coloring problems. In the min-coloring problem, all edges must be colored using as few colors as possible.
Favrholdt, Lene Monrad; id_orcid, Ehmsen, Martin R., Kohrt, Jens Svalgaard, Mihai, Rodica   +3 more
core   +1 more source

Strong edge-coloring of graphs with maximum edge weight seven

Journal of Combinatorial Optimization
A strong edge-coloring of a graph $G$ is an edge-coloring such that any two edges of distance at most two receive distinct colors. The minimum number of colors we need in order to give $G$ a strong edge-coloring is called the strong chromatic index of $G$, denoted by $χ_s'(G)$.
openaire   +2 more sources

Strong edge-colorings of sparse graphs with large maximum degree

, 2018
A strong k-edge-coloring of a graph G is a mapping from E(G) to {1, 2, ... , k} such that every two adjacent edges or two edges adjacent to the same edge receive distinct colors.
André Raspaud, Raspaud, Andre, Kostochka, Alexandr V., Ilkyoo Choi, Choi, Ilkyoo, Jaehoon Kim, Kim, Jaehoon, Alexandr V. Kostochka   +7 more
core   +1 more source

Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]

, 2010
An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core  

Graph coloring under constraints

, 2020
Dans cette thèse, nous nous intéressons à différentes notions de colorations sous contraintes. Nous nous intéressons plus spécialement à la coloration acyclique, à la coloration forte d'arêtes et à la coloration d'arêtes sommets adjacents distinguants ...
HOCQUARD, Hervé
core  

A multi layered encryption framework using intuitionistic fuzzy graphs and graph theoretic domination for secure communication networks. [PDF]

Sci Rep
Meenakshi A, Dhanushiya S, Mrsic L, Kalampakas A, Samanta S.   +4 more
europepmc   +1 more source

Fuzzy incidence coloring under structural operations for communication channel allocation. [PDF]

Sci Rep
Deji A, Wang Q, Zhou L.
europepmc   +1 more source

Structural basis for dimerization, catalytic regulation, and substrate selectivity of the chloroplast S9D CGEP protease in Arabidopsis thaliana. [PDF]

Protein Sci
Ehrlich JJ, Routray P, Enns L, van Wijk KJ, Kawate T.   +4 more
europepmc   +1 more source

A lightweight cryptographic algorithm incorporating path coloring of cartesian product of graphs. [PDF]

Sci Rep
Shivapriya P, Meera KN, Lin Y.
europepmc   +1 more source