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
Lobsters with an almost perfect matching are graceful
Authors
Elliot Krop
Publication date
17 February 2014
Publisher
View
on
arXiv
Abstract
Let
T
T
T
be a lobster with a matching that covers all but one vertex. We show that in this case,
T
T
T
is graceful.Comment: 4 page
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.764.1...
Last time updated on 30/10/2017