Contract grant sponsor: NSF; Contract grant number: DMS-0965587; Contract grant sponsor: Russian Foundation for Basic Research; Contract grant number: 09-01-00244.
A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge
Article first published online: 4 DEC 2012
© 2012 Wiley Periodicals, Inc.
Journal of Graph Theory
Volume 74, Issue 2, pages 222–235, October 2013
How to Cite
Kostochka, A., Stocker, C. and Hamburger, P. (2013), A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge. J. Graph Theory, 74: 222–235. doi: 10.1002/jgt.21706
- Issue published online: 2 AUG 2013
- Article first published online: 4 DEC 2012
- Manuscript Revised: 30 AUG 2012
- Manuscript Received: 7 JUN 2011
- NSF. Grant Number: DMS-0965587
- Russian Foundation for Basic Research. Grant Number: 09-01-00244
Options for accessing this content:
- If you are a society or association member and require assistance with obtaining online access instructions please contact our Journal Customer Services team.
- If your institution does not currently subscribe to this content, please recommend the title to your librarian.
- Login via other institutional login options http://onlinelibrary.wiley.com/login-options.
- You can purchase online access to this Article for a 24-hour period (price varies by title)
- If you already have a Wiley Online Library or Wiley InterScience user account: login above and proceed to purchase the article.
- New Users: Please register, then proceed to purchase the article.
Login via OpenAthens
Search for your institution's name below to login via Shibboleth.
Registered Users please login:
- Access your saved publications, articles and searches
- Manage your email alerts, orders and subscriptions
- Change your contact information, including your password
Please register to:
- Save publications, articles and searches
- Get email alerts
- Get all the benefits mentioned below!