The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...