The Kelmans-Seymour conjecture. IV: A proof (Q777491): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2019.12.002 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2995620170 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1612.07189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivisions in apex graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hajos' graph-coloring conjecture: Variations and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph connectivity after path removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism theorems for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the conjecture of Hajos / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz / 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: A weaker version of Lovász' path removal conjecture / 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: Do 3n − 5 edges force a subdivision ofK5? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced paths in 5-connected graphs / 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: Q4075398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent paths and \(K_{5}\)-subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(3n-5\) edges do force a subdivision of \(K_5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Menger's graph theorem / 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: Q5539653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Homeomorphism Properties of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decomposition with applications to subdivisions and path systems modulo <i>k</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>K</i><sub>5</sub>-Subdivisions in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dirac's conjecture on \(K_ 5\)-subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Hajós' conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Draw a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5766469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and Connectivity in 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
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2019.12.002 / rank
 
Normal rank

Latest revision as of 03:24, 10 December 2024

scientific article
Language Label Description Also known as
English
The Kelmans-Seymour conjecture. IV: A proof
scientific article

    Statements

    The Kelmans-Seymour conjecture. IV: A proof (English)
    0 references
    0 references
    0 references
    0 references
    7 July 2020
    0 references
    \(K_5\)-subdivision
    0 references
    independent paths
    0 references
    separation
    0 references
    connectivity
    0 references
    discharging
    0 references
    contraction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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