On the number of noncritical vertices in strongly connected digraphs
From MaRDI portal
Publication:2473681
DOI10.1007/s11006-006-0078-7zbMath1133.05043MaRDI QIDQ2473681
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
digraph; Hamiltonian cycle; critical vertex; strongly connected digraph; biconnected graph; maximal proper strong subdigraph
05C20: Directed graphs (digraphs), tournaments
Related Items
On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\), Multipartite tournaments: a survey
Cites Work
- Unnamed Item
- 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
- On induced subgraphs of a block
- The structure of saturated critical blocks