$$b$$ b -Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs

Published 2014 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
$$b$$ b -Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs
Authors
Keywords
b-Coloring, Stability number two, Co-triangle-free graphs, NP-hardness, Treecographs, Polytime dynamic programming algorithms
Journal
ALGORITHMICA
Volume 73, Issue 2, Pages 289-305
Publisher
Springer Nature
Online
2014-08-02
DOI
10.1007/s00453-014-9921-5
References
View 3 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.