Title of article
Kernels in edge-coloured orientations of nearly complete graphs Original Research Article
Author/Authors
H. Galeana-S?nchez، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
9
From page
4599
To page
4607
Abstract
We call the digraph D an orientation of a graph G if D is obtained from G by the orientation of each edge of G in exactly one of the two possible directions. The digraph D is an m-coloured digraph if the arcs of D are coloured with m-colours.
Keywords
Kernel , Orientation , Kernel by monochromatic paths
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947076
Link To Document