Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable

DOI10.1007/BF02350628zbMath0761.05090OpenAlexW2091248144MaRDI QIDQ1196561

Mostafa Blidia, Konrad Engel

Publication date: 16 January 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02350628

zbMATH Keywords

perfect graphsacyclic orientationperfectly orderable graphskernel \(M\)-solvable

Mathematics Subject Classification ID

Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Perfectly contractile graphs and quadratic toric rings ⋮ Perfect graphs, kernels, and cores of cooperative games

Cites Work

• Unnamed Item
• On kernels in perfect graphs
• Parity graphs are kernel-M-solvable
• Kernels in some orientations of comparability graphs
• Almost all Berge Graphs are Perfect

This page was built for publication: Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable