• Title of article

    Coloring Meyniel graphs in linear time

  • Author/Authors

    Lévêque، نويسنده , , Benjamin and Maffray، نويسنده , , Frédéric، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2005
  • Pages
    4
  • From page
    25
  • To page
    28
  • Abstract
    A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel graph and finds a clique of maximum size.
  • Keywords
    Perfect graphs , algorithm , Meyniel graphs , Coloring
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Serial Year
    2005
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Record number

    1454078

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