Critical kernel imperfect problem in generalizations of bipartite tournaments
DOI10.1007/S00373-019-02022-5zbMATH Open1416.05126OpenAlexW2923785292WikidataQ128206642 ScholiaQ128206642MaRDI QIDQ2000560FDOQ2000560
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
kernelarc-locally in-semicomplete digraph3-anti-quasi-transitive digraph3-quasi-transitive digraphCKI-digraphgeneralization of bipartite tournaments
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- The structure of strong arc-locally semicomplete digraphs
- Solutions of irreflexive relations
- Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
- The strong perfect graph theorem
- On kernel-perfect critical digraphs
- Structural properties of CKI-digraphs
- A characterization of locally semicomplete CKI-digraphs
- The structure of strong arc-locally in-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
- A classification of all arc-locally semicomplete digraphs
- Kernels in quasi-transitive digraphs
- Kernels and perfectness in arc-local tournament digraphs
- A conjecture on 3-anti-quasi-transitive digraphs
- Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments
Cited In (1)
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)
