Almost given length cycles in digraphs

DOI10.1007/S00373-007-0769-1MaRDI QIDQ2482351zbMATH OpenOpenAlexFDO

Authors Raphael Yuster

Publication date 16 April 2008

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-007-0769-1

zbMATH Keywords

regularity lemmadirected cycledirected graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Almost symmetric cycles in large digraphs
• Directed graphs without short cycles
• Short cycles in digraphs
• Cycles of length 0 modulo k in directed graphs
• Cycles and paths of many lengths in bipartite digraphs

Cites work

• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• Constructive Quasi-Ramsey Numbers and Tournament Ranking
• On the maximum cardinality of a consistent set of arcs in a random tournament
• Testing subgraphs in directed graphs
• The Algorithmic Aspects of the Regularity Lemma

Cited in

(7)

• On the number of cycles possible in digraphs with large girth
• Directed graphs without short cycles
• Digraphs containing every possible pair of dicycles
• Almost symmetric cycles in large digraphs
• scientific article; zbMATH DE number 3875315 (Why is no real title available?)
• Digraphs that have at most one walk of a given length with the same endpoints
• scientific article; zbMATH DE number 2077649 (Why is no real title available?)

This page was built for publication: Almost given length cycles in digraphs

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