A characterization of locally semicomplete CKI-digraphs

DOI10.1007/s00373-016-1708-9zbMath1351.05096OpenAlexW2343051502MaRDI QIDQ343738

Hortensia Galeana-Sánchez, Mika Olsen

Publication date: 29 November 2016

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

Full work available at URL: https://doi.org/10.1007/s00373-016-1708-9

zbMATH Keywords

kernelCKI-digraphslocally semicomplete digraphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Critical kernel imperfect problem in generalizations of bipartite tournaments ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ \(\alpha\)-diperfect digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
• On kernel-perfect critical digraphs
• A classification of locally semicomplete digraphs
• Perfect graphs, kernels, and cores of cooperative games
• Structural properties of CKI-digraphs
• Locally semicomplete digraphs: A generalization of tournaments
• Generalizations of tournaments: A survey
• Locally semicomplete digraphs that are complementarym-pancyclic
• CKI-digraphs, generalized sums and partitions of digraphs

This page was built for publication: A characterization of locally semicomplete CKI-digraphs