Total Digraphs

Abstract

Listen

Translate article

The line - graph of an ordinary graph G is that graph whose points can be put in one-to-one correspondence with the lines of G in such a way that two points of are adjacent if and only if the corresponding lines of G are adjacent. This concept originated with Whitney [ 5 ], has the property that its (point) chromatic number equals the line chromatic number of G, where the point (line) chromatic number of graph is the minimum number of colors required to color the points (lines) of the graph such that adjacent points (lines) are colored differently.