Results 221 to 224 of about 1,143 (224)

The Chromatic Number of the Two-packing of a Forest

1997
A two-packing of a graph G is a bijection σ : V(G) → V(G) such that for every two adjacent vertices a, b € V(G) the vertices σ(a)) and σ(b) are not adjacent. It is known [2], [6] that every forest G which is not a star has a two packing σ. If F σ is the graph whose vertices are the vertices of G and in which two vertices a, b are adjacent if and only ...
Hong Wang, Norbert Sauer
openaire   +1 more source

Packing Chromatic Number of Windmill Related Graphs

Journal of Xidian University, 2020
openaire   +1 more source

Packing chromatic number, $$\mathbf (1, 1, 2, 2) $$ ( 1 , 1 , 2 , 2 ) -colorings, and characterizing the Petersen graph

Aequationes Mathematicae, 2017
Boštjan Brešar, Sandi Klavžar, Douglas Rall   +2 more
exaly  

Improved bounds on Packing Chromatic Numbers via SAT Solver

Zicheng Han, Jiamu Zheng, Xiande Zhang
openaire   +1 more source