A boundary class for the \(k\)-path partition problem (Q1791978): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129697265, #quickstatements; #temporary_batch_1728174919759
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On easy and hard hereditary classes of graphs with respect to the independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness results for some problems on subclasses of bipartite and chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path partition problem and related problems in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-path partition of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path-partition problem in bipartite distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-path partitions in trees / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129697265 / rank
 
Normal rank

Latest revision as of 01:54, 6 October 2024

scientific article
Language Label Description Also known as
English
A boundary class for the \(k\)-path partition problem
scientific article

    Statements

    Identifiers

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