Long cycles, heavy cycles and cycle decompositions in digraphs

DOI10.1016/J.JCTB.2020.12.008MaRDI QIDQ1998760zbMATH OpenOpenAlexFDO

Authors Charlotte Knierim, Maxime Larcher, Anders Martinsson, 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 walklong cyclescycle decompositiondecomposition of digraphsHajós' conjecture

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4091535
• Cycle decompositions of pathwidth-6 graphs
• Path and cycle decompositions of dense graphs
• What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
• scientific article; zbMATH DE number 4061286

Cites work

• scientific article; zbMATH DE number 3857112 (Why is no real title available?)
• scientific article; zbMATH DE number 4101240 (Why is no real title available?)
• scientific article; zbMATH DE number 3253072 (Why is no real title available?)
• A proof of a conjecture of Bondy concerning paths in weighted digraphs
• Beautiful conjectures in graph theory
• Cycle packing
• Cycles in weighted graphs
• Graph theory
• Hajós' conjecture and projective graphs
• Hajós' conjecture and small cycle double covers of planar graphs
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Introduction to Random Graphs
• Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs
• Notes on heavy cycles in weighted digraphs
• On maximal paths and circuits of graphs
• Partitions of digraphs into paths or circuits
• What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?

Cited in

(6)

• Heavy subgraph conditions for longest cycles to be heavy in graphs
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• Note on long paths in Eulerian digraphs
• Long Cycles, Heavy Cycles and Cycle Decompositions in Digraphs
• What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
• Decompositions of complete graphs into long cycles

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

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