Some operations preserving the existence of kernels

DOI10.1016/S0012-365X(99)00026-6zbMath0936.05047MaRDI QIDQ1301845

Mostafa Blidia, Frédéric Maffray, Pierre Duchet, Henry Jacob, Henri Meyniel

Publication date: 26 April 2000

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

zbMATH Keywords

kernels of digraphssolvability of graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Perfect graphs, kernels, and cores of cooperative games ⋮ Kernels and some operations in edge-coloured digraphs ⋮ \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Perfect graphs are kernel solvable
• Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete

This page was built for publication: Some operations preserving the existence of kernels