vix.ing · top · new · best · stats

Three-colourability and forbidden subgraphs. II: polynomial algorithms

2002/05/01 by Bert Randerath, Ingo Schiermeyer, Meike Tewes · 53 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Algorithm #Bounded function #Chromatic polynomial #Class (philosophy) #Combinatorics #Computer science #Decision problem #Discrete mathematics #Existential quantification #Graph #Graph Labeling and Dimension Problems #Mathematics #Time complexity #graph theory and CDMA systems

paper · doi:10.1016/s0012-365x(01)00335-1

published in Discrete Mathematics 251(1-3), 137-153 (Elsevier BV)

crossref issued 2002/05/01 · crossref published 2002/05/01 · crossref published-print 2002/05/01 · openalex publication_date 2002/05/01 · crossref created 2002/07/26 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/03/10 · crossref indexed 2026/06/10

Citations

Cited by