Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 (Q392641): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6245561 / rank
 
Normal rank
Property / zbMATH Keywords
 
digraphs
Property / zbMATH Keywords: digraphs / rank
 
Normal rank
Property / zbMATH Keywords
 
kernel
Property / zbMATH Keywords: kernel / rank
 
Normal rank
Property / zbMATH Keywords
 
covering number
Property / zbMATH Keywords: covering number / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2013.03.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061441695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of CKI-digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent problems and results about kernels in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernels in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orientation of meyniel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs, kernels, and cores of cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs are kernel solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial game theory foundations applied to digraph kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial games: Selected bibliography with a succinct gourmet introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels in digraphs with covering number at most 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels in a special class of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernel-perfect critical digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484907 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:20, 7 July 2024

scientific article
Language Label Description Also known as
English
Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
scientific article

    Statements

    Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 (English)
    0 references
    0 references
    15 January 2014
    0 references
    0 references
    digraphs
    0 references
    kernel
    0 references
    covering number
    0 references
    0 references