◍wovepaper
SearchResearchersInstitutions
Sign in
cs.DMApr 1, 2016
authors
  • Wing-Kai Hon
  • Ton Kloks
  • Fu-Hong Liu
  • Hsiang-Hsuan Liu
  • Tao-Ming Wang
institutions
  • National Tsing Hua University
  • Tunghai University
  • University of Liverpool
arXiv abstractPDF
paper

On the Grundy number of Cameron graphs

arXiv:1604.07128

Abstract

The Grundy number of a graph is the maximal number of colors attained by a first-fit coloring of the graph. The class of Cameron graphs is the Seidel switching class of cographs. In this paper we show that the Grundy number is computable in polynomial time for Cameron graphs.

References in corpus (2)

  • First-fit coloring on interval graphs has performance ratio at least 5
  • More bounds for the Grundy number of graphs
◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.