The Stable Set Problem in Graphs With Bounded Genus and Bounded Odd Cycle Packing Number

doi 10.1137/1.9781611975994.176
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Graphs With Bounded Tree-Width and Large Odd-Girth Are Almost Bipartite

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2010English

Deleting Vertices to Graphs of Bounded Genus

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2019English

On the Number of Connected Sets in Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus

SIAM Journal on Discrete Mathematics
Mathematics
1996English

An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2010English

Separable Subgroups Have Bounded Packing

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2011English

Collective Tree Spanners in Graphs With Bounded Genus, Chordality, Tree-Width, or Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Testing Expansion in Bounded-Degree Graphs

2007English

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy