The price of connectivity for feedback vertex set (Q516802): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1510.02639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
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: The price of connectivity for cycle transversals / 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 12:53, 13 July 2024

scientific article
Language Label Description Also known as
English
The price of connectivity for feedback vertex set
scientific article

    Statements

    The price of connectivity for feedback vertex set (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 March 2017
    0 references
    price of connectivity
    0 references
    feedback vertex set
    0 references
    connected feedback vertex set
    0 references
    forbidden induced subgraph
    0 references

    Identifiers