On kernels in i-triangulated graphs

DOI10.1016/0012-365X(86)90095-6zbMath0617.05029MaRDI QIDQ1821791

Frédéric Maffray

Publication date: 1986

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

zbMATH Keywords

kernel-perfect digraphnormal orientationi-triangulated graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Recent problems and results about kernels in directed graphs ⋮ Fractional kernels in digraphs ⋮ Perfect graphs are kernel solvable ⋮ On the kernel and related problems in interval digraphs ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ On kernels in perfect graphs ⋮ Perfect graphs with polynomially computable kernels ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On kernels and semikernels of digraphs
• Parity graphs are kernel-M-solvable
• On the perfect graph conjecture
• Solutions of irreflexive relations
• On the orientation of meyniel graphs

This page was built for publication: On kernels in i-triangulated graphs