Total Digraphs
Canadian mathematical bulletin, Tome 9 (1966) no. 2, pp. 171-176

Voir la notice de l'article provenant de la source Cambridge

DOI

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.
Chartrand, Gary; Stewart, M. James. Total Digraphs. Canadian mathematical bulletin, Tome 9 (1966) no. 2, pp. 171-176. doi: 10.4153/CMB-1966-021-x
@article{10_4153_CMB_1966_021_x,
     author = {Chartrand, Gary and Stewart, M. James},
     title = {Total {Digraphs}},
     journal = {Canadian mathematical bulletin},
     pages = {171--176},
     year = {1966},
     volume = {9},
     number = {2},
     doi = {10.4153/CMB-1966-021-x},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-021-x/}
}
TY  - JOUR
AU  - Chartrand, Gary
AU  - Stewart, M. James
TI  - Total Digraphs
JO  - Canadian mathematical bulletin
PY  - 1966
SP  - 171
EP  - 176
VL  - 9
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-021-x/
DO  - 10.4153/CMB-1966-021-x
ID  - 10_4153_CMB_1966_021_x
ER  - 
%0 Journal Article
%A Chartrand, Gary
%A Stewart, M. James
%T Total Digraphs
%J Canadian mathematical bulletin
%D 1966
%P 171-176
%V 9
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-021-x/
%R 10.4153/CMB-1966-021-x
%F 10_4153_CMB_1966_021_x

Cité par Sources :