White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

A Class of Three-Colorable Triangle-Free Graphs

Radovanovic, M and Vuskovic, K (2012) A Class of Three-Colorable Triangle-Free Graphs. Journal of Graph Theory. ISSN 0364-9024


There is a more recent version of this eprint available. Click here to view it.

Available under licence : See the attached licence file.

Download (138Kb)


The chromatic number of a triangle-free graph can be arbitrarily large. In this article, we show that if all subdivisions of K2, 3 are also excluded as induced subgraphs, then the chromatic number becomes bounded by 3. We give a structural characterization of this class of graphs, from which we derive an coloring algorithm, where n denotes the number of vertices and m the number of edges of the input graph.

Item Type: Article
Copyright, Publisher and Additional Information: © 2012, Wiley Blackwell. This is an author produced version of a paper published in Journal of Graph Theory. Uploaded in accordance with the publisher's self-archiving policy.
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 25 Jun 2012 09:57
Last Modified: 10 Jun 2014 00:09
Published Version: http://dx.doi.org/10.1002/jgt.21651
Status: Published
Publisher: Wiley blackwell
Identification Number: 10.1002/jgt.21651
URI: http://eprints.whiterose.ac.uk/id/eprint/74343

Available Versions of this Item

Actions (repository staff only: login required)