On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\)
type: Item
instance of: scholarly article
title: On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\)
zbMATH Open document ID: 1236.05118
published in: Discrete Mathematics
publication date: 2010-04-27T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 5701980
zbMATH Keywords: non-critical vertex
zbMATH Keywords: strong tournament
zbMATH Keywords: transitive tournament
zbMATH Keywords: almost transitive tournament
zbMATH Keywords: regular tournament
zbMATH Keywords: near-regular tournament
author: S. V. Savchenko
MaRDI profile type: Publication
full work available at URL: j.disc.2009.11.013
OpenAlex ID: W1989583959
cites work: The number of cut-vertices in a graph of given minimum degree
cites work: The number of cutvertices in graphs with given minimum degree
cites work: Q5576817
cites work: Q3412126
cites work: Q4873756
cites work: Q5442548
cites work: Q3635517
cites work: Q5585195
cites work: The number of cut vertices and cut arcs in a strong directed graph
cites work: On the number of noncritical vertices in strongly connected digraphs
cites work: Non-critical vertices and long circuits in strong tournaments of order \(n\) and diameter \(d\)
cites work: Hamiltonian-connected tournaments
cites work: Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
DOI: 10.1016/J.DISC.2009.11.013
Recommended article: Non-critical vertices and long circuits in strong tournaments of order \(n\) and diameter \(d\)
Recommended article: Q3635517
Recommended article: The number of out-pancyclic vertices in a strong tournament
Recommended article: Q3412126
Recommended article: Q5442548
Recommended article: On the number of noncritical vertices in strongly connected digraphs
Recommended article: Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
Recommended article: The number of vertices whose out-arcs are pancyclic in a 2-strong tournament
Recommended article: Proof of the Caccetta-Häggkvist conjecture for in-tournaments with respect to the minimum out-degree, and pancyclicity
Recommended article: Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz
description: scientific article; zbMATH DE number 5701980