On kernel-perfect orientations of line graphs

DOI10.1016/S0012-365X(98)00091-0zbMath0955.05049OpenAlexW2055132375MaRDI QIDQ1584425

Alexandr V. Kostochka, Oleg V. Borodin, Douglas R. Woodall

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00091-0

zbMATH Keywords

digraphline graphorientationkernel-perfect

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

List-Coloring Claw-Free Graphs with $\Delta-1$ Colors ⋮ The list chromatic index of simple graphs whose odd cycles intersect in at most one edge ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ Unnamed Item ⋮ Edge-choosability of multicircuits

Cites Work

• Kernels in perfect line-graphs
• A counterexample to a conjecture of Meyniel on kernel-perfect graphs
• The list chromatic index of a bipartite multigraph

This page was built for publication: On kernel-perfect orientations of line graphs