Long cycles in graphs and digraphs

DOI10.1016/J.ENDM.2006.06.002MaRDI QIDQ3439406zbMATH OpenOpenAlexFDO

Authors Lech Adamus

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.06.002

zbMATH Keywords

almost symmetric cyclebipartite graphdigraphlong cycleorientation of cycle

Mathematics Subject Classification ID

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

Cites work

• Almost symmetric cycles in large digraphs
• Cycles in digraphs– a survey
• scientific article; zbMATH DE number 426372 (Why is no real title available?)
• scientific article; zbMATH DE number 3902696 (Why is no real title available?)
• scientific article; zbMATH DE number 19220 (Why is no real title available?)
• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• Note on Hamilton Circuits
• On maximal circuits in directed graphs
• Ore and Erdős type conditions for long cycles in balanced bipartite graphs
• Orientations of hamiltonian cycles in large digraphs
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: Long cycles in graphs and digraphs

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