Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
From MaRDI portal
Publication:392641
DOI10.1016/j.disc.2013.03.008zbMath1279.05031MaRDI QIDQ392641
Mika Olsen, Hortensia Galeana-Sánchez
Publication date: 15 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.03.008
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
CKI-digraphs, generalized sums and partitions of digraphs, A characterization of locally semicomplete CKI-digraphs, Infinite quasi-transitive digraphs with domination number 2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On kernels in perfect graphs
- Topics on perfect graphs
- The strong perfect graph theorem
- On kernel-perfect critical digraphs
- Perfect graphs are kernel solvable
- Kernels in a special class of digraphs
- Combinatorial game theory foundations applied to digraph kernels
- Combinatorial games: Selected bibliography with a succinct gourmet introduction
- Kernels in digraphs with covering number at most 3
- Perfect graphs, kernels, and cores of cooperative games
- Structural properties of CKI-digraphs
- Recent problems and results about kernels in directed graphs
- On the orientation of meyniel graphs
- Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview