The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\) (Q777489): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2994710724 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1602.07557 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonseparating Cycles in 4-Connected Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-separating paths in 4-connected graphs / 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 | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:09, 23 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\) |
scientific article |
Statements
The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\) (English)
0 references
7 July 2020
0 references
subdivision of graph
0 references
independent paths
0 references
nonseparating path
0 references
planar graph
0 references