Partitioning vertices of a tournament into independent cycles

DOI10.1006/JCTB.2001.2048MaRDI QIDQ1850562zbMATH OpenOpenAlexFDO

Authors Hao Li, Guantao Chen, Ronald Gould

Publication date 10 December 2002

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0e351c0c18c840f5be03878444fdf597e228f52b

zbMATH Keywords

strongly connected digraphstrong digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 2192120
• Cycles in a tournament with pairwise zero, one or two given vertices in common
• Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
• Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
• The partition of a strong tournament

Cites work

• scientific article; zbMATH DE number 3914352 (Why is no real title available?)
• scientific article; zbMATH DE number 568832 (Why is no real title available?)
• Complementary cycles of all lengths in tournaments
• Graph theory

Cited in

(19)

• Complementary cycles in regular bipartite tournaments
• Cycle factors in strongly connected local tournaments
• The partition of a strong tournament
• Cycles in a tournament with pairwise zero, one or two given vertices in common
• All regular multipartite tournaments that are cycle complementary
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
• On disjoint cycles of the same length in tournaments
• Lichiardopol's conjecture on disjoint cycles in tournaments
• All 2-connected in-tournaments that are cycle complementary
• A survey on Hamilton cycles in directed graphs
• Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
• Two proofs of Bermond-Thomassen conjecture for regular tournaments
• Complementary cycles of any length in regular bipartite tournaments
• Tournaments and Semicomplete Digraphs
• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture
• On 1-factors with prescribed lengths in tournaments
• scientific article; zbMATH DE number 2192120 (Why is no real title available?)
• Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles

This page was built for publication: Partitioning vertices of a tournament into independent cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850562)