438 citations
- University of WaterlooCA46 papers
- Hebei Normal UniversityCN19 papers
- Soochow UniversityCN13 papers
- University of OttawaCA10 papers
- Perimeter InstituteCA9 papers
- University of TorontoCA9 papers
- Chongqing UniversityCN8 papers
- Universidad Carlos III de MadridES7 papers
- University of California, DavisUS7 papers
- University of Rome Tor VergataIT7 papers
- York UniversityCA7 papers
- Uppsala UniversitySE6 papers
Showing 2009 · cs.DMShow all
2 papers · 2 filters
cs.DM2009
Finding a sun in building-free graphs
Elaine M. Eschen, Chinh T. Hoang, Jeremy P. Spinrad +1
Deciding whether an arbitrary graph contains a sun was recently shown to be NP-complete. We show that whether a building-free graph contains a sun can be decided in O(min$\{m{n^3},…
cs.DM2009★ 12 cited
A certifying algorithm for 3-colorability of P5-free graphs
Daniel Bruce, Chinh T. Hoang, Joe Sawada
We provide a certifying algorithm for the problem of deciding whether a P5- free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colo…