Triangle-free graphs that do not contain an induced subdivision of K₄ are 3-colorable

Chudnovsky, M, Liu, C-H, Schaudt, O et al. (3 more authors) (2019) Triangle-free graphs that do not contain an induced subdivision of K₄ are 3-colorable. Journal of Graph Theory, 92 (2). pp. 67-95. ISSN 0364-9024

Abstract

Metadata

Authors/Creators:
  • Chudnovsky, M
  • Liu, C-H
  • Schaudt, O
  • Spirkl, S
  • Trotignon, N
  • Vušković, K
Copyright, Publisher and Additional Information: © 2018 Wiley Periodicals, Inc. This is the peer reviewed version of the following article: Chudnovsky, M, Liu, C-H, Schaudt, O et al. (2018) Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. Journal of Graph Theory. ISSN 0364-9024, 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.
Keywords: coloring; induced subgraph
Dates:
  • Accepted: 14 November 2018
  • Published (online): 13 December 2018
  • Published: October 2019
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRCEP/N019660/1
Depositing User: Symplectic Publications
Date Deposited: 02 Jan 2019 11:53
Last Modified: 13 Dec 2019 01:38
Status: Published
Publisher: Wiley
Identification Number: https://doi.org/10.1002/jgt.22441
Related URLs:

Export

Statistics


CORE (COnnecting REpositories)