Journal article

All trees contain a large induced subgraph having all degrees 1 (mod k)

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Share
Cite

Cite this record

APA Style

Berman, D., Radcliffe, A., Scott, A., Wang, H., & Wargo, L. (1997). All trees contain a large induced subgraph having all degrees 1 (mod k). Discrete Mathematics, 175(1-3), 35–40.

MLA Style

Berman, D, et al. “ All Trees Contain a Large Induced Subgraph Having All Degrees 1 (Mod k).” Discrete Mathematics, vol. 175, nos. 1-3, 1997, pp. 35–40.

Chicago Style

Berman, D, A Radcliffe, A Scott, H Wang, and L Wargo. 1997. “ All Trees Contain a Large Induced Subgraph Having All Degrees 1 (Mod k).” Discrete Mathematics 175 (1-3): 35–40.
Print

Access Document

Publisher copy:: 10.1016/S0012-365X(96)00283-X

Authors

+ Berman, D More by this author

Role:: Author

+ Radcliffe, A More by this author

Role:: Author

+ Scott, A More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Mathematical Institute
Role:: Author

+ Wang, H More by this author

Role:: Author

+ Wargo, L More by this author

Role:: Author

Journal:: Discrete Mathematics More from this journal
Volume:: 175
Issue:: 1-3
Pages:: 35-40
Publication date:: 1997-10-01
DOI:: 10.1016/S0012-365X(96)00283-X
ISSN:: 0012-365X

Pubs id:: pubs:199425
UUID:: uuid:06bb6c17-b2d8-4e0b-b3ed-7841075df283
Local pid:: pubs:199425
Source identifiers:: 199425
Deposit date:: 2013-11-17
ARK identifier:: ark:/29072/ora_06bb6c17b2d84e0bb3ed7841075df283

Terms of use

Copyright date:: 1997

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP