We prove that a properly edge-coloured complete graph Kn has a Hamilton circuit with edges of at least n - √2n distinct colours. This is proved with a method inspired by work on long partial ...

Graph representation provides insightful views of data – linking features and providing a view into data connectedness based on data nodes (also known as vertices) that are connected via edges ...

SIAM Journal on Applied Mathematics, Vol. 38, No. 3 (Jun., 1980), pp. 364-372 (9 pages) We prove that the edge dominating set problem for graphs is NP-complete even when restricted to planar or ...