The Enumeration of Point Labelled Chromatic Graphs and Trees
- 1 January 1960
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 12, 535-545
- https://doi.org/10.4153/cjm-1960-047-1
Abstract
Given n points with c1 of one colour, c2 of another colour, up to k colours, linear graphs are formed with the restriction that no line connects points of the same colour. Following fairly standard terminology, coloured graphs with this restriction will be called point chromatic graphs. Giving the points numerical labels running from 1 to ci for points of the ith colour (i = 1, 2, … , k) forms point labelled chromatic graphs. Note that this description is slightly different from assigning a label and a colour independently to each point.Keywords
This publication has 3 references indexed in Scilit:
- Enumeration Of Labelled GraphsCanadian Journal of Mathematics, 1956
- A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPHProceedings of the National Academy of Sciences, 1954
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische VerbindungenActa Mathematica, 1937