Amanote Research

Amanote Research

    RegisterSign In

Properties of Vertex Cover Obstructions

Discrete Mathematics - Netherlands
doi 10.1016/j.disc.2007.01.003
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
Date

October 1, 2007

Authors
Michael J. DinneenRongwei Lai
Publisher

Elsevier BV


Related search

Approximation of Partial Capacitated Vertex Cover

SIAM Journal on Discrete Mathematics
Mathematics
2010English

Revisiting the Vertex Cover of Graphs

Applied Mathematical Sciences
2015English

On Cutwidth Parameterized by Vertex Cover

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2012English

Parameterized Complexity of Generalized Vertex Cover Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Improved Upper Bounds for Partial Vertex Cover

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Geometric Properties of Quantum Graphs and Vertex Scattering Matrices

Opuscula Mathematica
Mathematics
2010English

Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Crown Reductions for the Minimum Weighted Vertex Cover Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

Structures and Properties of Spherical 90-Vertex Fullerene-Like Nanoballs

Chemistry - A European Journal
Organic ChemistryCatalysisChemistry
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy