Results 211 to 214 of about 29,700 (214)

Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth

Combinatorics, Probability and Computing, 1998
For any integer k, we prove the existence of a uniquely k-colourable graph of girth at least g on at most k12(g+1) vertices whose maximal degree is at most 5k13. From this we deduce that, unless NP=RP, no polynomial time algorithm for k-Colourability on graphs G of girth g(G)[ges ]log[mid ]G[mid ]/13logk and maximum degree Δ(G ...
Bernd Kreuter, Thomas Emden-Weinert, Stefan Hougardy   +2 more
openaire   +2 more sources

Introduction to Graph Colouring

2015
In mathematics, a graph can be thought of as a set of objects in which some pairs of objects are connected by links. The interconnected objects are usually called vertices, with the links connecting pairs of vertices termed edges. Graphs can be used to model a surprisingly large number of problem areas, including social networking, chemistry ...
openaire   +2 more sources

Colouring of Graphs

2023
openaire   +1 more source

Graph colouring variations

2021
Bernard Ries, Alain Hertz
openaire   +2 more sources