On the existence of a connected component of a graph (Q3195646): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Effective Borel measurability and reducibility of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed choice and a uniform low basis theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Choice and Boundedness Principles in Computable Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weihrauch degrees, omniscience principles and weak computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of the finite intersection principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected components of graphs and reverse mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of the Radon-Nikodym Derivative / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (semi)lattices induced by continuous reducibilities / rank
 
Normal rank

Revision as of 23:06, 10 July 2024

scientific article
Language Label Description Also known as
English
On the existence of a connected component of a graph
scientific article

    Statements

    On the existence of a connected component of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 October 2015
    0 references
    0 references
    reverse mathematics
    0 references
    Weihrauch reducibility
    0 references
    component
    0 references
    graph
    0 references
    connected
    0 references
    partition
    0 references
    parallelization
    0 references
    0 references