Title of article
Orientable edge colorings of graphs Original Research Article
Author/Authors
Robert E. Jamison، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
10
From page
595
To page
604
Abstract
An edge coloring of a graph is orientable if and only if it is possible to orient the edges of the graph so that the color of each edge is determined by the head of its corresponding oriented arc. The goals of this paper include finding a forbidden substructure characterization of orientable colorings and giving a linear time recognition algorithm for orientable colorings.
Keywords
Directed graph , Edge coloring , Orientation , Recognition algorithm , Forbidden substructure , Closure
Journal title
Discrete Applied Mathematics
Serial Year
2011
Journal title
Discrete Applied Mathematics
Record number
887604
Link To Document