Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable
| dc.contributor.author | Chudnovsky, Maria | |
| dc.contributor.author | Liu, Chun-Hung | |
| dc.contributor.author | Schaudt, Oliver | |
| dc.contributor.author | Spirkl, Sophie | |
| dc.contributor.author | Trotignon, Nicolas | |
| dc.contributor.author | Vušković, Kristina | |
| dc.date.accessioned | 2022-08-12T01:12:09Z | |
| dc.date.available | 2022-08-12T01:12:09Z | |
| dc.date.issued | 2019-10 | |
| dc.description | This is the peer reviewed version of the following article: Chudnovsky, M., Liu, C.-H., Schaudt, O., Spirkl, S., Trotignon, N., & Vušković, K. (2019). Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. Journal of Graph Theory, 92(2), 67–95. https://doi.org/10.1002/jgt.22441, which has been published in final form at https://doi.org/10.1002/jgt.22441. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. | en |
| dc.description.abstract | We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivision of K4 are 3-colorable. This proves a conjecture of Trotignon and Vušković. | en |
| dc.description.sponsorship | We are thankful to Paul Seymour and Mingxian Zhong for many helpful discussions. This material is based upon work supported in part by the U.S. Army Research Laboratory and the U.S. Army Research Office (under grant number W911NF-16-1-0404). Maria Chudnovsky was supported by NSF grant (DMS-1550991) and U.S. Army Research Office grant (W911NF-16-1-0404). Chun-Hung Liu was supported by NSF grant (DMS-1664593). Nicolas Trotignon was partially supported by ANR project Stint (under reference ANR-13-BS02-0007) and by the LABEX MILYON (ANR-10-LABX-0070) of Université de Lyon, within the program “Investissements d’Avenir” (ANR-11-IDEX-0007) operated by the French National Research Agency (ANR). Kristina Vušković was partially supported by EPSRC grant (EP/N0196660/1), and Serbian Ministry of Education, Science and Technological Development (174033 and III44006). | en |
| dc.identifier.uri | https://doi.org/10.1002/jgt.22441 | |
| dc.identifier.uri | http://hdl.handle.net/10012/18529 | |
| dc.language.iso | en | en |
| dc.publisher | Wiley | en |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | induced subdivision | en |
| dc.subject | triangle-free graphs | en |
| dc.title | Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable | en |
| dc.type | Article | en |
| dcterms.bibliographicCitation | Chudnovsky, M., Liu, C.-H., Schaudt, O., Spirkl, S., Trotignon, N., & Vušković, K. (2019). Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. Journal of Graph Theory, 92(2), 67–95. https://doi.org/10.1002/jgt.22441 | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
| uws.typeOfResource | Text | en |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- triangle-free graphs with no induced.pdf
- Size:
- 429.25 KB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 4.47 KB
- Format:
- Item-specific license agreed upon to submission
- Description: