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

DOI10.1016/j.disc.2009.11.013zbMath1236.05118OpenAlexW1989583959MaRDI QIDQ966016

Sergey V. Savchenko

Publication date: 27 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.013

zbMATH Keywords

transitive tournamentregular tournamentalmost transitive tournamentnear-regular tournamentnon-critical vertexstrong tournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (3)

Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d ⋮ Partition of regular balanced \(c\)-tournaments into strongly connected \(c\)-tournaments ⋮ On the existence of noncritical vertices in digraphs

Cites Work

• The number of cutvertices in graphs with given minimum degree
• Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
• Hamiltonian-connected tournaments
• The number of cut-vertices in a graph of given minimum degree
• On the number of noncritical vertices in strongly connected digraphs
• Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d
• The number of cut vertices and cut arcs in a strong directed graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\)