Skip to main content Accessibility help
×
Home

The Enumeration of Point Labelled Chromatic Graphs and Trees

  • T. L. Austin (a1)

Extract

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.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      The Enumeration of Point Labelled Chromatic Graphs and Trees
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      The Enumeration of Point Labelled Chromatic Graphs and Trees
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      The Enumeration of Point Labelled Chromatic Graphs and Trees
      Available formats
      ×

Copyright

References

Hide All
1. Gilbert, E.N., Enumeration ojlabelled graphs, Can. J. Math., 8 (1956), 405411.
2. Polya, G., Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen, und chemische Verbindungen, Acta. Math., 68 (1937).
3. Riordan, John, An introduction to combinatorial analysis (New York, 1958).
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), 10041007.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

The Enumeration of Point Labelled Chromatic Graphs and Trees

  • T. L. Austin (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.