Critical kernel imperfect problem in generalizations of bipartite tournaments

DOI10.1007/S00373-019-02022-5MaRDI QIDQ2000560zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments
• New classes of critical kernel-imperfect digraphs
• Structural properties of CKI-digraphs
• CKI-digraphs, generalized sums and partitions of digraphs
• Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs

Cites work

• scientific article; zbMATH DE number 1764950 (Why is no real title available?)
• A characterization of locally semicomplete CKI-digraphs
• A classification of all arc-locally semicomplete digraphs
• A conjecture on 3-anti-quasi-transitive digraphs
• Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
• Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs
• Kernels and perfectness in arc-local tournament digraphs
• Kernels in quasi-transitive digraphs
• On kernel-perfect critical digraphs
• On the structure of strong 3-quasi-transitive 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
• Structural properties of CKI-digraphs
• The strong perfect graph theorem
• The structure of strong arc-locally in-semicomplete digraphs
• The structure of strong arc-locally semicomplete digraphs

Cited in

(5)

• Some results on Berge's conjecture and begin-end conjecture
• A characterization of locally semicomplete CKI-digraphs
• Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
• Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments
• CKI-digraphs, generalized sums and partitions of digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000560)