External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Maximum List r-Colorable Induced Subgraphs in kP₃-Free Graphs

Esther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi. Maximum List r-Colorable Induced Subgraphs in kP₃-Free Graphs. In Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman, editors, 33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland. Volume 351 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. [doi]

Authors

Esther Galby

This author has not been identified. Look up 'Esther Galby' in Google

Paloma T. Lima

This author has not been identified. Look up 'Paloma T. Lima' in Google

Andrea Munaro

This author has not been identified. Look up 'Andrea Munaro' in Google

Amir Nikabadi

This author has not been identified. Look up 'Amir Nikabadi' in Google
runs on