Cycle-pancyclism in tournaments. I

DOI10.1007/BF01793009MaRDI QIDQ1900518zbMATH OpenOpenAlexFDO

Authors Hortensia Galeana-Sánchez, Sergio Rajsbaum

Publication date 6 May 1997

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

Full work available at URL https://doi.org/10.1007/bf01793009

zbMATH Keywords

boundstournamentspanning cycle

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Cycle-pancyclism in tournaments. III
• Cycle-pancyclism in bipartite tournaments II
• Cycle-pancyclism in tournaments. II
• Pancyclic in-tournaments
• A conjecture on cycle-pancyclism in tournaments

Cites work

• Cycles in digraphs– a survey
• Cycles of Each Length in Regular Tournaments

Cited in

(4)

• Pancyclic in-tournaments
• Cycles in team tennis and other paired-element contests
• An extreme problem concerning k-arc-cyclic property for a class of tournaments
• Cycle-pancyclism in tournaments. III

This page was built for publication: Cycle-pancyclism in tournaments. I

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