Kernels in quasi-transitive digraphs

DOI10.1016/j.disc.2006.02.015zbMath1100.05042MaRDI QIDQ2501570

Rocío Rojas-Monroy, Hortensia Galeana-Sánchez

Publication date: 14 September 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.02.015

zbMATH Keywords

kernel-perfect digraphs

Mathematics Subject Classification ID

05C20: Directed graphs (digraphs), tournaments

Related Items

\((H, k)\)-reachability in \(H\)-arc-colored digraphs, \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs, Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs, Critical kernel imperfect problem in generalizations of bipartite tournaments, Chordality of locally semicomplete and weakly quasi-transitive digraphs, Richardson's theorem in quasi-transitive and pre-transitive digraphs, \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs, Restricted domination in quasi-transitive and 3-quasi-transitive digraphs, Infinite quasi-transitive digraphs with domination number 2, Infinite kernel perfect digraphs, Unions of digraphs which become kernel perfect

Cites Work

• On kernels and semikernels of digraphs
• Perfect graphs are kernel solvable
• A note on kernel-critical graphs
• On monochromatic paths in edge-coloured digraphs
• Kings in quasi-transitive digraphs
• Solutions of irreflexive relations
• A sufficient condition for a digraph to be kernel-perfect
• Graphes Noyau-Parfaits
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
• Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
• Quasi‐transitive digraphs
• Transitiv orientierbare Graphen
• Extension Theorems for Solutions of Irreflexive Relations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item