Long cycles, heavy cycles and cycle decompositions in digraphs

DOI10.1016/J.JCTB.2020.12.008OpenAlexW3119374459MaRDI QIDQ1998760FDOQ1998760

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

Recommendations

• scientific article
• 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

zbMATH Keywords

random walklong cyclescycle decomposition[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Haj%EF%BF%BD%EF%BF%BDs%27+conjecture&go=Go Haj��s' conjecture]decomposition of digraphs

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)

Cites Work

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

Cited In (6)

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

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)