Long cycles, heavy cycles and cycle decompositions in digraphs

DOI10.1016/j.jctb.2020.12.008OpenAlexW3119374459MaRDI QIDQ1998760

Anders Martinsson, Charlotte Knierim, Maxime Larcher, Andreas Noever

Publication date: 8 March 2021

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

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

zbMATH Keywords

random walkcycle decompositionlong cyclesHajós' conjecturedecomposition of digraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)

Related Items (2)

Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Note on long paths in Eulerian digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notes on heavy cycles in weighted digraphs
• Partitions of digraphs into paths or circuits
• Cycles in weighted graphs
• Hajós' conjecture and small cycle double covers of planar graphs
• Hajós' conjecture and projective graphs
• A proof of a conjecture of Bondy concerning paths in weighted digraphs
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Beautiful conjectures in graph theory
• Graph Theory
• Introduction to Random Graphs
• On maximal paths and circuits of graphs
• What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
• Cycle packing
• Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs

This page was built for publication: Long cycles, heavy cycles and cycle decompositions in digraphs