On the number of noncritical vertices in strongly connected digraphs

DOI10.1007/s11006-006-0078-7zbMath1133.05043OpenAlexW2051444762MaRDI QIDQ2473681

Sergey V. Savchenko

Publication date: 4 March 2008

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11006-006-0078-7

zbMATH Keywords

digraphHamiltonian cyclecritical vertexstrongly connected digraphbiconnected graphmaximal proper strong subdigraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Multipartite tournaments: a survey ⋮ On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\) ⋮ On the existence of noncritical vertices in digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Non-\(\kappa\)-critical vertices in graphs
• The number of cutvertices in graphs with given minimum degree
• The number of cut-vertices in a graph of given minimum degree
• Contractible subgraphs in 3-connected graphs
• A theorem on $2$-connected graphs
• On induced subgraphs of a block
• The structure of saturated critical blocks

This page was built for publication: On the number of noncritical vertices in strongly connected digraphs