On the complexity of the 3-kernel problem in some classes of digraphs (Q2442275): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.1727 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975584720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679215 / 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: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of strong 3-quasi-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-kernels in multipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of \(k\)-kernels in digraphs and in weighted digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclically k-partite digraphs and k-kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-kernels in generalizations of transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weakly ordered systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to a generalization of Richardson's theorem / rank
 
Normal rank

Latest revision as of 13:57, 7 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of the 3-kernel problem in some classes of digraphs
scientific article

    Statements

    On the complexity of the 3-kernel problem in some classes of digraphs (English)
    0 references
    0 references
    0 references
    0 references
    2 April 2014
    0 references
    0 references
    kernel
    0 references
    3-kernel
    0 references
    NP-completeness
    0 references
    multipartite tournament
    0 references
    cyclically 3-partite digraphs
    0 references
    k-quasi-transitive digraph
    0 references
    0 references