A parity digraph has a kernel

DOI10.1007/BF02579405zbMath0599.05028OpenAlexW2028515467MaRDI QIDQ1080430

Mostafa Blidia

Publication date: 1986

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

kerneldirected graphsparity digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Recent problems and results about kernels in directed graphs ⋮ Combinatorial games on a graph ⋮ Parity graphs are kernel-M-solvable ⋮ Finding kernels or solving SAT ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ A new generalization of kernels in digraphs ⋮ On kernels in perfect graphs

Cites Work

• Unnamed Item
• A counterexample to a conjecture of Meyniel on kernel-perfect graphs
• Solutions of irreflexive relations
• Graphes Noyau-Parfaits

This page was built for publication: A parity digraph has a kernel