On the number of noncritical vertices in strongly connected digraphs (Q2473681): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Sergey V. Savchenko / rank
Normal rank
 
Property / author
 
Property / author: Sergey V. Savchenko / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11006-006-0078-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051444762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of cutvertices in graphs with given minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of cut-vertices in a graph of given minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induced subgraphs of a block / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractible subgraphs in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of saturated critical blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on $2$-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-\(\kappa\)-critical vertices in graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:09, 27 June 2024

scientific article
Language Label Description Also known as
English
On the number of noncritical vertices in strongly connected digraphs
scientific article

    Statements

    On the number of noncritical vertices in strongly connected digraphs (English)
    0 references
    4 March 2008
    0 references
    0 references
    digraph
    0 references
    strongly connected digraph
    0 references
    biconnected graph
    0 references
    critical vertex
    0 references
    maximal proper strong subdigraph
    0 references
    Hamiltonian cycle
    0 references
    0 references