CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Claw-free t-perfect graphs can be recognised in polynomial time
Authors
A. Schrijver
A.M.H. Gerards
+13 more
F. Maffray
F.B. Shepherd
H. Bruhn
H. Bruhn
J. Fonlupt
M. Boulala
M. Chudnovsky
M. Chudnovsky
M.R. Fellows
M.W. Padberg
N. Sbihi
N.D. Roussopoulos
V. Chvátal
Publication date
30 October 2013
Publisher
Doi
Cite
View
on
arXiv
Abstract
A graph is called t-perfect if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect
Similar works
Full text
Available Versions
CiteSeerX
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:CiteSeerX.psu:10.1.1.741.4...
Last time updated on 30/10/2017
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1007%2F978-3-319-0...
Last time updated on 22/07/2021