Results 21 to 30 of about 255,219 (274)

Fast algorithm for S-packing coloring of Halin graphs

arXiv.org
Motivated by frequency assignment problems in wireless broadcast networks, Goddard, Hedetniemi, Hedetniemi, Harris, and Rall introduced the notion of $S$-packing coloring in 2008.
Xin Zhang, Dezhi Zou
semanticscholar   +2 more sources

On The Packing k-Coloring of Some Family Trees

Statistics, Optimization & Information Computing
All graphs in this paper are simple and connected. Let $G=(V,E)$ be a graph where $V(G)$ is nonempty of vertex set of $G$ and $E(G)$ is possibly empty set of unordered pairs of elements of $V(G)$.
A. I. Kristiana, Sri Moeliyana Citra, Dafik, R. Alfarisi, R. Adawiyah   +4 more
semanticscholar   +3 more sources

Graph Coloring Below Guarantees via Co-Triangle Packing [PDF]

International Symposium on Algorithms and Computation
In the $\ell$-Coloring Problem, we are given a graph on $n$ nodes, and tasked with determining if its vertices can be properly colored using $\ell$ colors. In this paper we study below-guarantee graph coloring, which tests whether an $n$-vertex graph can
Shyan S. Akmal, Tomohiro Koana
semanticscholar   +2 more sources

Packing $(1,1,2,4)$-coloring of subcubic outerplanar graphs [PDF]

, 2020
For $1\leq s_1 \le s_2 \le \ldots \le s_k$ and a graph $G$, a packing $(s_1, s_2, \ldots, s_k)$-coloring of $G$ is a partition of $V(G)$ into sets $V_1, V_2, \ldots, V_k$ such that, for each $1\leq i \leq k$, the distance between any two distinct $x,y\in V_i$ is at least $s_i + 1$. The packing chromatic number, $ _p(G)$, of a graph $G$ is the smallest
Alexandr Kostochka, Xujun Liu
openalex   +3 more sources

Packing coloring of hypercubes with extended Hamming codes [PDF]

Discrete Applied Mathematics, 2023
Petr Gregor, Jaka Kranjc, Borut Lužar, Kenny Štorgel   +3 more
semanticscholar   +3 more sources

Modeling the packing coloring problem of graphs

Applied Mathematical Modelling, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Z. Shao, A. Vesel
semanticscholar   +3 more sources

The packing coloring of distance graphs D(k, t) [PDF]

Discrete Applied Mathematics, 2013
J. Ekstein, Přemysl Holub, O. Togni
semanticscholar   +4 more sources

On $S$-Packing Edge-Coloring of Graphs with Edge Weight at most 6

Social Science Research Network, 2023
Jian Lu, Xiang-Feng Pan
semanticscholar   +3 more sources

Coloring, packing and embedding of graphs

, 2012
Cette thèse se situe dans le domaine de graphes et de leurs applications, Elleest constitué de trois grandes parties, la première est consacrée à l’étude d’unnouveau type de coloration sommets distinguantes, les arête-colorations sommetsdistinguantespar écarte.
Mohammed Amin Tahraoui
openalex   +3 more sources

On the Packing Partitioning Problem on Directed Graphs

Mathematics, 2021
This work is aimed to continue studying the packing sets of digraphs via the perspective of partitioning the vertex set of a digraph into packing sets (which can be interpreted as a type of vertex coloring of digraphs) and focused on finding the minimum ...
Babak Samadi, Ismael G. Yero
doaj   +1 more source