Results 11 to 20 of about 9,106,907 (129)
On packing chromatic number of subcubic outerplanar graphs [PDF]
Discrete Applied Mathematics, 2018 Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number is finite (and small).
Holub, Přemysl +2 more
core +7 more sources
Packing chromatic number of transformation graphs
Thermal Science, 2019 Graph coloring is an assignment of labels called colors to elements of a graph. The packing coloring was introduced by Goddard et al. [1] in 2008 which is a kind of coloring of a graph. This problem is NP-complete for general graphs.
Ozen Dortok H.B. +3 more
core +3 more sources
The Packing Chromatic Number of the Infinite Square Grid Is at Least 14 [PDF]
, 2022 A packing k-coloring of a graph G = (V, E) is a mapping from V to {1, ..., k} such that any pair of vertices u, v that receive the same color c must be at distance greater than c in G.
Heule, Marijn J.H. +1 more
core +6 more sources
Bounds for packing chromatic number of some subclasses of trees
Discussiones Mathematicae Graph TheoryK. Mohamed Harith +2 more
doaj +2 more sources
Packing chromatic number versus chromatic and clique number [PDF]
Aequationes mathematicae, 2017 17 pages, 1 ...
Boštjan Brešar +3 more
openaire +3 more sources
Packing Chromatic Number of Subdivisions of Cubic Graphs [PDF]
Graphs and Combinatorics, 2019 20 pages, 15 ...
József Balogh +2 more
openaire +4 more sources
A Note on Packing Chromatic Number of the Square Lattice [PDF]
The Electronic Journal of Combinatorics, 2010 The concept of a packing colouring is related to a frequency assignment problem. The packing chromatic number $\chi_p(G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set $V (G)$ can be partitioned into disjoint classes $X_1, \dots, X_k$, where vertices in $X_i$ have pairwise distance greater than $i$.
Roman Soukal, Premysl Holub
openaire +3 more sources
The fractional chromatic number of triangle-free subcubic graphs [PDF]
, 2014 Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14 / 5. Improving on estimates of Hatami and Zhu and of Lu and Peng, we prove that the fractional chromatic number of any triangle-free ...
Král’, Daniel +5 more
core +1 more source
The harmonious chromatic number of almost all trees [PDF]
, 1995 A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards, Keith
core +1 more source
PACKING CHROMATIC NUMBER OF CERTAIN GRAPHS [PDF]
International Journal of Pure and Apllied Mathematics, 2013 The packing chromatic number (G) of a graph G is the smallest integer k for which there exists a mapping : V (G) −→ {1,2,...,k} such that any two vertices of color i are at distance at least i + 1. It is a frequency assignment problem used in wireless networks, which is also called broadcasting coloring.
A. William, S. Roy
openaire +1 more source