Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Vertex-disjoint cycles in local tournaments

From MaRDI portal
Publication:2005720
Jump to:navigation, search

DOI10.1016/j.disc.2020.112127zbMath1448.05090OpenAlexW3082240270MaRDI QIDQ2005720

Yubao Guo, Juanjuan Liang, Rui Juan Li, Xin-Hong Zhang

Publication date: 8 October 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2020.112127


zbMATH Keywords

vertex-disjoint cycleslocal tournamentsBermond-Thomassen conjectureround decomposablenon-round decomposable


Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)




Cites Work

  • Vertex-disjoint cycles in regular tournaments
  • Disjoint cycles in digraphs
  • Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
  • A classification of locally semicomplete digraphs
  • Vertex disjoint 4-cycles in bipartite tournaments
  • Locally semicomplete digraphs: A generalization of tournaments
  • A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
  • Cycles in digraphs– a survey
  • Connectivity properties of locally semicomplete digraphs
  • Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
  • Digraphs
  • Vertex-disjoint cycles in bipartite tournaments


This page was built for publication: Vertex-disjoint cycles in local tournaments

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2005720&oldid=14461747"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 17:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki