Minimum \(k\)-path vertex cover (Q2275922): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4111593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversal numbers of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detour Chromatic Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Systems Theory – EUROCAST 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On F-independence in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independence number in graphs of maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of a graph in terms of order and size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tightness of the \(\frac {5}{14}\) independence ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the independence ratio of triangle-free cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of \((2,2)\) path chromatic number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence, odd girth, and average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal analysis of security protocols for wireless sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination of graphs and small transversals of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Latest revision as of 09:53, 4 July 2024

scientific article
Language Label Description Also known as
English
Minimum \(k\)-path vertex cover
scientific article

    Statements

    Minimum \(k\)-path vertex cover (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm
    0 references
    path
    0 references
    vertex cover
    0 references
    dissociation number
    0 references
    path vertex cover
    0 references
    NP-complete
    0 references
    0 references
    0 references