Path coverings of the vertices of a tree (Q1251231): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128018129, #quickstatements; #temporary_batch_1722244795621
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly Traceable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a special class of hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly hamiltonian digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optional hamiltonian completion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on the Hamiltonian Completion Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the vertices of a graph by vertex-disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc coverings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits and path coverings of vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomly Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs in which every path is contained in a Hamilton path. / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128018129 / rank
 
Normal rank

Latest revision as of 11:20, 29 July 2024

scientific article
Language Label Description Also known as
English
Path coverings of the vertices of a tree
scientific article

    Statements

    Identifiers