An algorithm to Cyclic Path Covering Number (Q2839230): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2009.03.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095094198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COVERING AND PACKING IN GRAPHS, I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5656791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Triangle Case of the Acquaintance Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to Cyclic Path Covering Number / rank
 
Normal rank

Latest revision as of 15:16, 6 July 2024

scientific article
Language Label Description Also known as
English
An algorithm to Cyclic Path Covering Number
scientific article

    Statements

    An algorithm to Cyclic Path Covering Number (English)
    0 references
    0 references
    0 references
    4 July 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    path cover
    0 references
    path covering number
    0 references
    cyclic path cover
    0 references
    cyclic path covering number
    0 references
    0 references