Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_19 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3164438458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum common induced subgraph parameterized by vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bandwidth of Caterpillars with Hairs of Length 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Dimension of Bounded Tree-length Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Directed Edge Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced vertex-orderings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph isomorphism on graph classes that exclude a substructure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph motif problem parameterized by the structure of the input graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Domination and Covering: A Parameterized Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of vertex integrity and component order connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of length-bounded cuts and multicuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Makes Equitable Connected Partition Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some colorful problems parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of coloring problems: treewidth versus vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structural parameterizations of the bounded-degree vertex deletion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner forest problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with fixed number of bins revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Geodetic Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imbalance is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterised complexity of list problems on graphs of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imbalance parameterized by twin cover revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second order logic on graphs with local cardinality constraints / rank
 
Normal rank

Latest revision as of 18:22, 31 July 2024

scientific article; zbMATH DE number 7667136
Language Label Description Also known as
English
Exploring the gap between treedepth and vertex cover through vertex integrity
scientific article; zbMATH DE number 7667136

    Statements

    Exploring the gap between treedepth and vertex cover through vertex integrity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 March 2023
    0 references
    vertex integrity
    0 references
    vertex cover number
    0 references
    treedepth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers