Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-15T08:57:50.927Z Has data issue: false hasContentIssue false
  • English
  • Français

The Enumeration of Point Labelled Chromatic Graphs and Trees

Published online by Cambridge University Press:  20 November 2018

T. L. Austin
T. L. Austin*
Affiliation:
Technical Operations, Inc. Fort Monroe, Virginia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 12 , 1960 , pp. 535 - 545
Copyright
Copyright © Canadian Mathematical Society 1960

References

1. Gilbert, E.N., Enumeration ojlabelled graphs, Can. J. Math., 8 (1956), 405–411.Google Scholar
2. Polya, G., Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen, und chemische Verbindungen, Acta. Math., 68 (1937).Google Scholar
3. Riordan, John, An introduction to combinatorial analysis (New York, 1958).Google Scholar
4. Trent, H.M., A note on the enumeration and listing of all possible trees in a connected linear graph, Proc. Nat. Acad. Sci., 40 (1954), 1004–1007.Google Scholar