Quasi-Transitive Digraphs and Their Extensions (Q3120440): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(k\)-quasi-transitive digraphs of large diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Path Partition Conjecture is true for some generalizations of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs with the path‐merging property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint in- and out-branchings in tournaments and related path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linkages in locally semicomplete digraphs and quasi-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of strong arc-locally semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Paths in Decomposable Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of tournaments: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of hamiltonian path and cycle problems in certain classes of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths and cycles in extended and decomposable digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex heaviest paths and cycles in quasi-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kings in quasi-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-Disjoint Paths in Decomposable Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest path partitions in generalizations of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressive power of digraph solvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robbins's Theorem for Mixed Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871748 / 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: Distances in orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colourings, homomorphisms, and partitions of transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint paths in digraphs with bounded independence number / 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: The directed path partition conjecture / 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: Independent sets and non-augmentable paths in generalizations of tournaments / 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: Some results on 4-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of quasi-kernels in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientations of digraphs almost preserving diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint quasi-kernels in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the 3-kernel problem in some classes of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-transitive digraphs I: the structure of strong 4-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: Some remarks on the structure of strong \(k\)-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of 4-kings in bipartite tournaments with no 3-kings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the directed spanning cactus problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian-connected tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding kernels or solving SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((k-1)\)-kernels in strong \(k\)-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i>‐Kings in <i>k</i>‐Quasitransitive Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian paths in \(k\)-quasi-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs / rank
 
Normal rank

Latest revision as of 11:25, 18 July 2024

scientific article
Language Label Description Also known as
English
Quasi-Transitive Digraphs and Their Extensions
scientific article

    Statements

    Quasi-Transitive Digraphs and Their Extensions (English)
    0 references
    4 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references