Locally Semicomplete Digraphs and Generalizations (Q3120438): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast FAST / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Number of 4-Circuits in a Tournament / 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: \(k\)-strong spanning local tournaments in locally semicomplete digraphs / 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: Locally semicomplete digraphs: A generalization of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of 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: A note on vertex pancyclic oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of locally semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly Hamiltonian-connected locally semicomplete 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: Q4888111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner type problems for digraphs that are locally semicomplete or extended semicomplete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Colouring by Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing locally semicomplete digraphs into strong spanning subdigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: In-tournament 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: Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding complementary cycles in locally semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum spanning strong subdigraph problem is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem in logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs of classical theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for feedback arc set in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of locally semicomplete CKI-digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning local tournaments in locally semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Hamiltonian-connected locally semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally semicomplete digraphs that are complementarym-pancyclic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complementary cycles in locally semicomplete digraphs / 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: Extending cycles in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on spanning local tournaments in locally semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of local tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2836212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a digraph to be positive-round / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: All 2-connected in-tournaments that are cycle complementary / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex 6-pancyclic in-tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic in-tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic orderings of in-tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex pancyclic in-tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kings in locally semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Circuits in Graphs<sup>†</sup> / rank
 
Normal rank

Latest revision as of 11:25, 18 July 2024

scientific article
Language Label Description Also known as
English
Locally Semicomplete Digraphs and Generalizations
scientific article

    Statements

    Locally Semicomplete Digraphs and Generalizations (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
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers