Trotignon, N and Vuskovic, K (2017) On triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph. Journal of Graph Theory, 84 (3). pp. 233-248. ISSN 0364-9024
Abstract
We prove a decomposition theorem for the class of triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph. We prove that every graph of girth at least five in this class is 3-colorable.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2016 Wiley Periodicals, Inc. This is the peer reviewed version of the following article: Trotignon, N. and Vušković, K. (2017), On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph. J. Graph Theory, 84: 233–248. doi: 10.1002/jgt.22023, which has been published in final form at https://doi.org/10.1002/jgt.22023. This article may be used for non-commercial purposes in accordance with the Wiley Terms and Conditions for Self-Archiving. |
Keywords: | induced subdivision of K4; decompostion; coloring; 05C75 |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 11 Jan 2016 16:23 |
Last Modified: | 14 Apr 2017 05:02 |
Published Version: | https://doi.org/10.1002/jgt.22023 |
Status: | Published |
Publisher: | Wiley |
Identification Number: | 10.1002/jgt.22023 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:93202 |