• Title of article

    Triangle-free -free graphs are 4-colorable

  • Author/Authors

    Pyatkin، نويسنده , , Artem V.، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2013
  • Pages
    6
  • From page
    715
  • To page
    720
  • Abstract
    A graph is 2 P 3 -free if it does not contain two vertex-disjoint paths on three vertices as an induced subgraph. We prove that every triangle-free 2 P 3 -free graph is 4-colorable. This answers an open question posed by Broersma et al.
  • Keywords
    Triangle-free graph , Vertex coloring , 2 P 3 -free graph , chromatic number
  • Journal title
    Discrete Mathematics
  • Serial Year
    2013
  • Journal title
    Discrete Mathematics
  • Record number

    1600261

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=1600261