Polychromatic colorings of complete graphs with respect to 1‐, 2‐factors and Hamiltonian cycles
dc.contributor.author | Axenovich, Maria | |
dc.contributor.author | Lidicky, Bernard | |
dc.contributor.author | Goldwasser, John | |
dc.contributor.author | Hansen, Ryan | |
dc.contributor.author | Lidicky, Bernard | |
dc.contributor.author | Martin, Ryan | |
dc.contributor.author | Offner, David | |
dc.contributor.author | Talbot, John | |
dc.contributor.author | Young, Michael | |
dc.contributor.department | Mathematics | |
dc.date | 2018-10-29T21:14:40.000 | |
dc.date.accessioned | 2020-06-30T06:00:15Z | |
dc.date.available | 2020-06-30T06:00:15Z | |
dc.date.copyright | Sun Jan 01 00:00:00 UTC 2017 | |
dc.date.embargo | 2019-04-01 | |
dc.date.issued | 2018-04-01 | |
dc.description.abstract | <p>If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polychromatic number of G, denoted polyH(G), is the largest number of colors in an H-polychromatic coloring. In this paper, polyH(G) is determined exactly when G is a complete graph and H is the family of all 1-factors. In addition polyH(G) is found up to an additive constant term when G is a complete graph and H is the family of all 2-factors, or the family of all Hamiltonian cycles.</p> | |
dc.description.comments | <p>This is the peer reviewed version of the following article: Axenovich M, Goldwasser J, Hansen R, Lidický B, Martin RR, Offner D, Talbot J, Young M. Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. J Graph Theory. 2018;87:660–671, which has been published in final form at doi: <a href="https://doi-org.proxy.lib.iastate.edu/10.1002/jgt.22180">10.1002/jgt.22180</a>. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions.</p> | |
dc.format.mimetype | application/pdf | |
dc.identifier | archive/lib.dr.iastate.edu/math_pubs/188/ | |
dc.identifier.articleid | 1194 | |
dc.identifier.contextkey | 13192771 | |
dc.identifier.s3bucket | isulib-bepress-aws-west | |
dc.identifier.submissionpath | math_pubs/188 | |
dc.identifier.uri | https://dr.lib.iastate.edu/handle/20.500.12876/54577 | |
dc.language.iso | en | |
dc.source.bitstream | archive/lib.dr.iastate.edu/math_pubs/188/2017_Lidicky_PolychromaticColoringManuscript.pdf|||Fri Jan 14 21:46:43 UTC 2022 | |
dc.source.uri | 10.1002/jgt.22180 | |
dc.subject.disciplines | Mathematics | |
dc.title | Polychromatic colorings of complete graphs with respect to 1‐, 2‐factors and Hamiltonian cycles | |
dc.type | article | |
dc.type.genre | article | |
dspace.entity.type | Publication | |
relation.isAuthorOfPublication | a1d8f5ab-9124-4104-981c-8ba1e426e3ff | |
relation.isOrgUnitOfPublication | 82295b2b-0f85-4929-9659-075c93e82c48 |
File
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- 2017_Lidicky_PolychromaticColoringManuscript.pdf
- Size:
- 306.93 KB
- Format:
- Adobe Portable Document Format
- Description: