Degree sum and graph linkage with prescribed path lengths (Q1730224): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128943678, #quickstatements; #temporary_batch_1729681987854
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3065457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on semi-linkage with almost prescribed lengths in large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enomoto and Ota's conjecture holds for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precise location of vertices on Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Placing specified vertices at precise locations on a Hamiltonian cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type Theorem for Perfect Packings in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributing vertices along a Hamiltonian cycle in Dirac graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panconnected graphs. II / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128943678 / rank
 
Normal rank

Latest revision as of 13:20, 23 October 2024

scientific article
Language Label Description Also known as
English
Degree sum and graph linkage with prescribed path lengths
scientific article

    Statements

    Identifiers