Linking four vertices in graphs of large connectivity (Q2668016): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hajos' graph-coloring conjecture: Variations and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linkage for the diamond and the path with four vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kelmans-Seymour conjecture. I: Special separations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kelmans-Seymour conjecture. IV: A proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological minors in graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity for Kite-Linked Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological subgraphs in graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: 7-connected graphs are 4-ordered / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Menger's graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. IX: Disjoint crossed paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Solution to the Undirected Two Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved linear edge bound for graph linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivisions in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in graphs. I: 3-planar graphs and basic obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in graphs. II: A special case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in graphs. III: Characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing Hajós' 4-coloring conjecture to 4-connected graphs / rank
 
Normal rank

Latest revision as of 05:01, 28 July 2024

scientific article
Language Label Description Also known as
English
Linking four vertices in graphs of large connectivity
scientific article

    Statements

    Linking four vertices in graphs of large connectivity (English)
    0 references
    0 references
    3 March 2022
    0 references
    two-paths theorem
    0 references
    rooted subdivision
    0 references
    linkage
    0 references
    connectivity
    0 references
    0 references

    Identifiers

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