Disjoint cycles of different lengths in graphs and digraphs

zbMath1376.05038arXiv1510.06667MaRDI QIDQ1684653

Ngoc Khang Le, Ararat Harutyunyan, Nicolas Lichiardopol, Julien Bensmail, Bin Long Li

Publication date: 12 December 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.06667

zbMATH Keywords

minimum degreevertex-disjoint cyclesdifferent lengths

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Related Items (13)

Vertex-disjoint cycles of different lengths in multipartite tournaments ⋮ Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree ⋮ Properly colored cycles of different lengths in edge-colored complete graphs ⋮ Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ Vertex‐disjoint cycles of the same length in tournaments ⋮ Vertex-disjoint cycles of different lengths in local tournaments ⋮ Disjoint cycles in tournaments and bipartite tournaments ⋮ Partition and disjoint cycles in digraphs ⋮ Vertex-disjoint rainbow triangles in edge-colored graphs ⋮ An improvement of Lichiardopol's theorem on disjoint cycles in tournaments ⋮ Majority colorings of sparse digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjoint cycles in digraphs
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
• Disjoint directed cycles
• Vertex Disjoint Cycles of Different Length in Digraphs
• Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
• Cycles of even lengths modulo k
• A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
• Cycles in digraphs– a survey
• On decomposition of triangle-free graphs under degree constraints
• Decomposing graphs with girth at least five under degree constraints
• Some Theorems on Abstract Graphs
• Graph colouring and the probabilistic method

This page was built for publication: Disjoint cycles of different lengths in graphs and digraphs