Hamiltonian paths and cycles, number of arcs and independence number in digraphs

DOI10.1016/0012-365X(92)90139-7zbMath0760.05049OpenAlexW2086977571MaRDI QIDQ1199482

Denise Amar, Yannis Manoussakis

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90139-7

zbMATH Keywords

independence numberHamiltonian cyclesdigraphsHamiltonian paths

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On maximal circuits in directed graphs
• Chemins Et Circuits Dans Les Graphes Orientes
• Cycles in digraphs– a survey

This page was built for publication: Hamiltonian paths and cycles, number of arcs and independence number in digraphs