Characterising \(k\)-connected sets in infinite graphs (Q2171028): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2022.08.004 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4792909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $k$-Blocks: A Connectivity Invariant for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly connected sets and the excluded grid theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profinite separation systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretical versus topological ends of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite end-devouring sets of rays with prescribed start vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of infinite tree sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial Decompositions of Infinite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Maximalzahl fremder unendlicher Wege in Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Menger-like property of the three-width of infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set theory. An introduction to independence proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typical subgraphs of 3- and 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal infinite graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Menger-like property of tree-width: The finite case / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2022.08.004 / rank
 
Normal rank

Latest revision as of 08:25, 17 December 2024

scientific article
Language Label Description Also known as
English
Characterising \(k\)-connected sets in infinite graphs
scientific article

    Statements

    Characterising \(k\)-connected sets in infinite graphs (English)
    0 references
    0 references
    0 references
    23 September 2022
    0 references
    infinite graphs
    0 references
    connectivity
    0 references
    structural characterisation of families of graphs
    0 references
    \(k\)-connected sets
    0 references
    \(k\)-tree-width
    0 references
    duality theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references