Separating Stable Sets in Claw-Free Graphs via Padberg-Rao and Compact Linear Programs

doi 10.1137/1.9781611973099.102
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

On Linear and Circular Structure of (Claw, Net)-Free Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2003English

Claw-Free Circular-Perfect Graphs

Journal of Graph Theory
GeometryTopology
2010English

Induced Disjoint Paths in Claw-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2015English

Colouring Squares of Claw-Free Graphs

Canadian Journal of Mathematics
Mathematics
2019English

Claw-Free Graphs. V. Global Structure

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

Total Coloring of Claw-Free Planar Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

Spectral Radius and Traceability of Connected Claw-Free Graphs

Filomat
Mathematics
2016English

The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs

Journal of Graph Theory
GeometryTopology
2013English

Linear Separation of Connected Dominating Sets in Graphs

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy