Kernels in digraphs that are not kernel perfect (Q442354): 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: 05C38 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6064663 / rank
 
Normal rank
Property / zbMATH Keywords
 
digraph kernel
Property / zbMATH Keywords: digraph kernel / rank
 
Normal rank
Property / zbMATH Keywords
 
parity condition
Property / zbMATH Keywords: parity condition / rank
 
Normal rank
Property / zbMATH Keywords
 
undirected path parity
Property / zbMATH Keywords: undirected path parity / rank
 
Normal rank
Property / zbMATH Keywords
 
breaking odd cycles
Property / zbMATH Keywords: breaking odd cycles / rank
 
Normal rank
Property / zbMATH Keywords
 
not kernel perfect
Property / zbMATH Keywords: not kernel perfect / 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.2012.05.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044021461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressive power of digraph solvability / 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: The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-theoretic approach to default logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernels, defaults and even graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph theoretical structures in logic programs and default theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games / 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: On kernels and semikernels of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Theorem of Richardson / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of irreflexive relations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:46, 5 July 2024

scientific article
Language Label Description Also known as
English
Kernels in digraphs that are not kernel perfect
scientific article

    Statements

    Identifiers