Title of article :
On kernel-perfect orientations of line graphs Original Research Article
Author/Authors :
O.V. Borodin، نويسنده , , A.V. Kostochka، نويسنده , , D.R. Woodall، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
Abstract :
We exploit the technique of Galvin (1995) to prove that an orientation D of a line-graph G (of a multigraph) is kernel-perfect if and only if every oriented odd cycle in D has a chord (or pseudochord) and every clique has a kernel.
Keywords :
Orientations , Kernel-perfect digraphs , Line graphs
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
