Article ID Journal Published Year Pages File Type
4651941 Electronic Notes in Discrete Mathematics 2015 8 Pages PDF
Abstract

The colouring number col(G) of a graph G is the minimum integer k such that there exists a linear ordering of the vertices of G in which each vertex v has back-degree at most k, i.e. v has at most k neighbours u with u

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics