CORE
🇺🇦
make metadata, not war
Services
Research
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
Detecting a long odd hole
Authors
Maria Chudnovsky
Alex Scott
Paul Seymour
Publication date
1 January 2016
Publisher
View
on
arXiv
Abstract
For each integer
t
≥
5
t\ge 5
t
≥
5
, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least
t
t
t
and odd
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
University of Richmond
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:scholarship.richmond.edu:l...
Last time updated on 29/10/2019
University of Richmond
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:scholarship.richmond.edu:p...
Last time updated on 29/10/2019
University of Richmond
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:scholarship.richmond.edu:j...
Last time updated on 29/10/2019