Knocking out \(P_k\)-free graphs (Q2352787): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.04.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2280813015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating graphs by means of parallel knock-out schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds and algorithms for parallel knock-out numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of the parallel knock-out problem / 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: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knocking Out P k -free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path factors and parallel knock-out schemes of almost claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Knockouts in the Complete Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:06, 10 July 2024

scientific article
Language Label Description Also known as
English
Knocking out \(P_k\)-free graphs
scientific article

    Statements

    Knocking out \(P_k\)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    6 July 2015
    0 references
    parallel knock-out schemes
    0 references
    Hamilton cycle
    0 references
    cographs
    0 references
    split graphs
    0 references
    computational complexity
    0 references

    Identifiers