On a class of kernel-perfect and kernel-perfect-critical graphs

DOI10.1016/0012-365X(93)90068-5zbMath0782.05035OpenAlexW2035216900MaRDI QIDQ685562

Peter Hamburger, Kiran B. Chilakamarri

Publication date: 24 February 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90068-5

zbMATH Keywords

directed graphkernelkernel-perfect graphkernel-perfect-critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs ⋮ Perfect graphs, kernels, and cores of cooperative games

Cites Work

• On kernel-perfect critical digraphs
• A note on kernel-critical graphs
• Graphes Noyau-Parfaits
• Unnamed Item
• Unnamed Item

This page was built for publication: On a class of kernel-perfect and kernel-perfect-critical graphs