Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class ...
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
Vikraman Arvind, Christine T. Cheng, Nikhil R. Dev...
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...