We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Let mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if 4 and mad(G) < 14 5 , then i(G...