The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\) (Q777490): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2287828383 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1609.05747 / 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: Contractible edges and triangles in \(k\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent paths and \(K_{5}\)-subdivisions / 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: 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: 2-linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and Connectivity in Graphs / rank
 
Normal rank

Latest revision as of 02:09, 23 July 2024

scientific article
Language Label Description Also known as
English
The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
scientific article

    Statements

    The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\) (English)
    0 references
    0 references
    0 references
    0 references
    7 July 2020
    0 references
    subdivision of graph
    0 references
    independent paths
    0 references
    nonseparating path
    0 references
    planar graph
    0 references

    Identifiers

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