Proof of the Seymour conjecture for large graphs (Q1272361): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60060518, #quickstatements; #temporary_batch_1711574657256
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Square of a Hamiltonian Cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian square-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a Packing Conjecture of Bollobás / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the square of a Hamiltonian cycle in dense graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01626028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017776863 / rank
 
Normal rank

Latest revision as of 08:26, 30 July 2024

scientific article
Language Label Description Also known as
English
Proof of the Seymour conjecture for large graphs
scientific article

    Statements

    Proof of the Seymour conjecture for large graphs (English)
    0 references
    0 references
    0 references
    0 references
    18 May 1999
    0 references
    dense graphs
    0 references
    Hamiltonian cycle
    0 references

    Identifiers