The following pages link to Keith J. Edwards (Q383737):
Displaying 36 items.
- Achromatic number of collections of paths and cycles (Q383738) (← links)
- (Q426743) (redirect page) (← links)
- On harmonious colouring of trees (Q426747) (← links)
- Improved upper bounds for planarization and series-parallelization of degree-bounded graphs (Q426901) (← links)
- (Q494788) (redirect page) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- On the neighbour-distinguishing index of a graph (Q855303) (← links)
- A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
- The complexity of colouring problems on dense graphs (Q1079363) (← links)
- The complexity of some graph colouring problems (Q1192946) (← links)
- The harmonious chromatic number of complete \(r\)-ary trees (Q1301657) (← links)
- The complexity of harmonious colouring for trees (Q1346692) (← links)
- Edge decomposition of complete tripartite graphs (Q1412671) (← links)
- The computational complexity of cordial and equitable labelling (Q1567263) (← links)
- Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi (Q1567683) (← links)
- The achromatic number of bounded degree trees (Q1584329) (← links)
- On monochromatic component size for improper colourings (Q1775062) (← links)
- Fragmentability of graphs (Q1850531) (← links)
- On a problem concerning piles of counters (Q1923522) (← links)
- Harmonious chromatic number of directed graphs (Q1932457) (← links)
- Complete colourings of hypergraphs (Q2279996) (← links)
- The complexity of solution-free sets of integers for general linear equations (Q2334046) (← links)
- Planarization and fragmentability of some classes of graphs (Q2427499) (← links)
- (Q3043706) (← links)
- Achromatic number of fragmentable graphs (Q3055929) (← links)
- (Q3724369) (← links)
- (Q3804062) (← links)
- A new upper bound for the harmonious chromatic number (Q4242954) (← links)
- New upper bounds on harmonious colorings (Q4290578) (← links)
- (Q4352945) (← links)
- (Q4364806) (← links)
- Detachments of Complete Graphs (Q4680568) (← links)
- The Harmonious Chromatic Number of Bounded Degree Graphs (Q4716669) (← links)
- (Q4818789) (← links)
- The Harmonious Chromatic Number of Almost All Trees (Q4844488) (← links)
- The Harmonious Chromatic Number of Bounded Degree Trees (Q4883059) (← links)