Critical kernel imperfect problem in generalizations of bipartite tournaments

DOI10.1007/s00373-019-02022-5zbMath1416.05126OpenAlexW2923785292WikidataQ128206642 ScholiaQ128206642MaRDI QIDQ2000560

Ruixia Wang

Publication date: 28 June 2019

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

Full work available at URL: https://doi.org/10.1007/s00373-019-02022-5

zbMATH Keywords

kernelarc-locally in-semicomplete digraph3-anti-quasi-transitive digraph3-quasi-transitive digraphCKI-digraphgeneralization of bipartite tournaments

Mathematics Subject Classification ID

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

Related Items (1)

Some results on Berge's conjecture and begin-end conjecture

Cites Work

• Unnamed Item
• A characterization of locally semicomplete CKI-digraphs
• Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
• A classification of all arc-locally semicomplete digraphs
• Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs
• On the structure of strong 3-quasi-transitive digraphs
• The strong perfect graph theorem
• The structure of strong arc-locally in-semicomplete digraphs
• On kernel-perfect critical digraphs
• The structure of strong arc-locally semicomplete digraphs
• Kernels and perfectness in arc-local tournament digraphs
• A conjecture on 3-anti-quasi-transitive digraphs
• Kernels in quasi-transitive digraphs
• Structural properties of CKI-digraphs
• Solutions of irreflexive relations
• Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments

This page was built for publication: Critical kernel imperfect problem in generalizations of bipartite tournaments