Paths with a given number of vertices from each partite set in regular multipartite tournaments (Q2433729): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.2006.04.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009246799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in bipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diconnected Orientations and a Conjecture of Las Vergnas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in multipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3828034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4487469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Subtournaments of a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4756732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles with a given number of vertices from each partite set in regular multipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-diregular subgraphs in semicomplete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kings in semicomplete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diregularc-partite tournaments are vertex-pancyclic whenc ? 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344011 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:26, 24 June 2024

scientific article
Language Label Description Also known as
English
Paths with a given number of vertices from each partite set in regular multipartite tournaments
scientific article

    Statements

    Paths with a given number of vertices from each partite set in regular multipartite tournaments (English)
    0 references
    0 references
    0 references
    30 October 2006
    0 references
    0 references
    0 references