On kernel-perfect orientations of line graphs

DOI10.1016/S0012-365X(98)00091-0MaRDI QIDQ1584425zbMATH OpenOpenAlexFDO

Authors Oleg V. Borodin, Alexandr Kostochka, 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

line graphdigraphorientationkernel-perfect

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Kernels in perfect line-graphs
• On kernels in perfect graphs
• k-Kernels in orientations of the line graph
• Recent problems and results about kernels in directed graphs
• scientific article; zbMATH DE number 4095496

Cites work

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

Cited in

(8)

• Edge-choosability of multicircuits
• Perfect graphs, kernels, and cores of cooperative games
• The list chromatic index of simple graphs whose odd cycles intersect in at most one edge
• scientific article; zbMATH DE number 7790331 (Why is no real title available?)
• scientific article; zbMATH DE number 5130732 (Why is no real title available?)
• Kernels in perfect line-graphs
• List-coloring claw-free graphs with \(\Delta-1\) colors
• k-Kernels in orientations of the line graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584425)