AN ORIENTED 7-COLOURING OF PLANAR GRAPHS WITH GIRTH AT LEAST 7

被引：0
|
作者：
Borodin, O. V. [1 ]
Ivanova, A. O. [2 ]
机构：
[1] Russian Acad Sci, Inst Math, Siberian Branch, Akad Koptyuga Ave 4, Novosibirsk 630090, Russia
[2] Yakut State Univ, Yakutsk 677000, Russia
来源：
SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA | 2005年 / 2卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
An oriented k-colouring of digraph H is an oriented homomorphism of H into a k-vertex tournament. We prove that every orientation of a plane graph with girth at least 7 has an oriented 7-colouring.
引用
收藏
页码：222 / 229
页数：8
相关论文
共 50 条
12345