Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Christophe Picouleau / rank
Normal rank
 
Property / author
 
Property / author: Christophe Picouleau / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2266980279 / rank
 
Normal rank
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: Blockers for the stability number and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The most vital nodes with respect to independent set and vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of three edge contraction problems with degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pathwidth and Treewidth of Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four classes of perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(d\)-blockers and \(d\)-transversals in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger Number of Graphs with Small Chordality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining a Bipartite Graph by Contracting Few Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex blocker clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the removal of forbidden graphs by edge-deletion or by edge- contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-hardness of edge-deletion and -contraction problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:36, 10 July 2024

scientific article
Language Label Description Also known as
English
Contraction Blockers for Graphs with Forbidden Induced Paths
scientific article

    Statements

    Contraction Blockers for Graphs with Forbidden Induced Paths (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers