The Price of Connectivity for Cycle Transversals (Q2946410): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5419953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Connectivity for Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of connectivity for dominating set: upper bounds and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected vertex covers in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hadwiger's Number and the Stability Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Feedback Vertex Set in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connecting face hitting sets in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect connected-dominant graphs / rank
 
Normal rank

Latest revision as of 19:23, 10 July 2024

scientific article
Language Label Description Also known as
English
The Price of Connectivity for Cycle Transversals
scientific article

    Statements

    Identifiers

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