Spanning eulerian subdigraphs in semicomplete digraphs (Q6046690): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4288347397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for a Digraph to be Supereulerian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning 2-strong tournaments in 3-strong semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian dicycles avoiding prescribed arcs in tournaments / 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: Q3274170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trail-connected tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4756732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian-connected tournaments / rank
 
Normal rank

Latest revision as of 03:08, 3 August 2024

scientific article; zbMATH DE number 7746586
Language Label Description Also known as
English
Spanning eulerian subdigraphs in semicomplete digraphs
scientific article; zbMATH DE number 7746586

    Statements

    Spanning eulerian subdigraphs in semicomplete digraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 October 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    arc-connectivity
    0 references
    Eulerian subdigraph
    0 references
    polynomial algorithm
    0 references
    semicomplete digraph
    0 references
    tournament
    0 references
    0 references