Results 11 to 20 of about 254,850 (275)

Counting packings of list-colorings of graphs

Enumerative Combinatorics and Applications
11 ...
Hemanshu Kaul, Jeffrey A. Mudrock
doaj   +4 more sources

Grundy Packing Coloring of Graphs [PDF]

Discrete Applied Mathematics
16 pages, 5 figures, 6 tables, 37 ...
Didem Gözüpek, Iztok Peterin
semanticscholar   +5 more sources

Packing list‐colorings [PDF]

Random Structures & Algorithms, 2023
AbstractList coloring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list‐coloring, we seek many in parallel. Our explorations have uncovered a potentially rich seam of interesting problems spanning chromatic graph theory. Given a ‐list‐assignment of a graph ,
Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang   +3 more
openalex   +8 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)$.
Arika Indah Kristiana, Sri Moeliyana Citra, Dafik Dafik, Ridho Alfarisi, Robiatul Adawiyah   +4 more
openalex   +3 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

Dichotomies properties on computational complexity of S-packing coloring problems [PDF]

Discrete Mathematics, 2015
Nicolas Gastineau
openalex   +3 more sources

On S-packing edge-coloring of graphs with given edge weight

Discussiones Mathematicae Graph Theory
Jian Lu, Xiang-Feng Pan
openalex   +2 more sources

Packing colorings of subcubic outerplanar graphs [PDF]

Aequationes mathematicae, 2020
Given a graph $G$ and a nondecreasing sequence $S=(s_1,\ldots,s_k)$ of positive integers, the mapping $c:V(G)\longrightarrow \{1,\ldots,k\}$ is called an $S$-packing coloring of $G$ if for any two distinct vertices $x$ and $y$ in $c^{-1}(i)$, the distance between $x$ and $y$ is greater than $s_i$. The smallest integer $k$ such that there exists a $(1,2,
Boštjan Brešar, Nicolas Gastineau, Olivier Togni   +2 more
openalex   +6 more sources

Packing coloring of Sierpiński-type graphs [PDF]

Aequationes mathematicae, 2018
26 pages, 16 ...
B. Brešar, Jasmina Ferme
semanticscholar   +4 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