Prefer a chat interface with context about you and your work?
Counting Coloured Graphs of High Connectivity
Find exact or asymptotic formulae for the number of labelled graphs of order n having a certain property. The property we are interested in in this note is that of being k -coloured and having connectivity at least l . Special cases of this problem have been tackled by many …