Name
Abstract | ||
|---|---|---|
3-list colouring is an NP-complete decision problem. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving 3-list colouring on permutation graphs. |
Year | Venue | Keywords |
|---|---|---|
2011 | Clinical Orthopaedics and Related Research | permutation graph,bipartite graph,decision problem,discrete mathematics |
Field | DocType | Volume |
Permutation graph,Discrete mathematics,Combinatorics,Indifference graph,Chordal graph,Cyclic permutation,Cograph,Pathwidth,Mathematics,Split graph,Dense graph | Journal | abs/1104.5 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jessica Enright | 1 | 8 | 3.89 |
| Lorna Stewart | 2 | 361 | 28.05 |