Some results on stable sets for k-colorable P₆-free graphs and generalizations

類似資料

• Independent sets in (P₆, diamond)-free graphs
  著者:: Raffaele Mosca
  出版事項: (2009-01-01)
• Extremal K_(s,t)-free bipartite graphs
  著者:: Camino Balbuena, 等
  出版事項: (2008-01-01)
• Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
  著者:: Gábor Bacsó, 等
  出版事項: (2009-01-01)
• All totally symmetric colored graphs
  著者:: Mariusz Grech, 等
  出版事項: (2013-03-01)
• An expected polynomial time algorithm for coloring 2-colorable 3-graphs
  著者:: Yury Person, 等
  出版事項: (2011-05-01)