On kernel-perfect orientations of line graphs

DOI10.1016/S0012-365X(98)00091-0zbMATH Open0955.05049OpenAlexW2055132375MaRDI QIDQ1584425FDOQ1584425

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

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

zbMATH Keywords

line graphdigraphorientationkernel-perfect

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

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

Cited In (8)

• List-coloring claw-free graphs with \(\Delta-1\) colors
• k-Kernels in orientations of the line graph
• Title not available (Why is that?)
• Kernels in perfect line-graphs
• Title not available (Why is that?)
• Perfect graphs, kernels, and cores of cooperative games
• The list chromatic index of simple graphs whose odd cycles intersect in at most one edge
• Edge-choosability of multicircuits

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)