Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Decycling graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Circuits Contained in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility Among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of restricted spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex \(k\)-path cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-path vertex cover of some graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of dissociation set problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the minimum 3-path vertex cover and dissociation number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for the connected vertex cover problem in 4-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Brittle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a unique tree representation for \(P_ 4\)-extendible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent packings in structured graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle lengths and chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithm for the vertex cover \(P_k\) problem on cacti / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total dominating sequences in trees, split graphs, and under modular decomposition / rank
 
Normal rank

Revision as of 02:52, 21 July 2024

scientific article
Language Label Description Also known as
English
Hitting subgraphs in \(P_4\)-tidy graphs
scientific article

    Statements

    Hitting subgraphs in \(P_4\)-tidy graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 November 2019
    0 references
    hitting set
    0 references
    decycling number
    0 references
    \(k\)-path vertex cover
    0 references
    \(P_4\)-tidy graph
    0 references
    quasi-spider
    0 references

    Identifiers