Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d

DOI10.1002/jgt.20615zbMath1247.05093OpenAlexW1519330495MaRDI QIDQ2911489

Sergey V. Savchenko

Publication date: 31 August 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20615

zbMATH Keywords

tournamentcircuittransitive tournamentnon-critical vertex

Mathematics Subject Classification ID

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

Related Items (1)

On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\)

Cites Work

• Unnamed Item
• A note on the number of Hamiltonian paths in strong tournaments
• On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\)
• On the number of cycles in local tournaments
• Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
• On the number of Hamiltonian cycles in tournaments
• Vertex deletion and cycles in multipartite tournaments
• Locally semicomplete digraphs: A generalization of tournaments
• Connectivity properties of locally semicomplete digraphs
• Quasi‐transitive digraphs
• On Subtournaments of a Tournament
• Tournaments That Admit Exactly One Hamiltonian Circuit

This page was built for publication: Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d