A Class of Three-Colorable Triangle-Free Graphs
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 deri...
|Place of publication:||
HOBOKEN Blackwell Publishing Ltd 01.04.2013
Wiley Subscription Services, Inc
|published in:||Journal of graph theory Vol. 72; no. 4; pp. 430 - 439|
|Data of publication:||2013-04|
Partially supported by Serbian Ministry for Education and Science grants III44006 and 174033, Serbian-French Technology Co-Operation grant Pavle Savić 2010-2011, and EPSRC grant EP/H021426/1.
Partially supported by Serbian Ministry for Education and Science grants III44006 and 174033, Serbian‐French Technology Co‐Operation grant Pavle Savić 2010‐2011, and EPSRC grant EP/H021426/1.
|Online Access:||available in Bonn?|
Web of Knowledge
Science Citation Index Expanded
Web of Science
Web of Science - Science Citation Index Expanded - 2013
Academic OneFile (A&I only)
Database information Databases - DBIS