Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T03:38:03.312Z Has data issue: false hasContentIssue false

Chromatic Number and Topological Complete Subgraphs

Published online by Cambridge University Press:  20 November 2018

G. A. Dirac*
Affiliation:
University of Dublin, Eire
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.

A graph with m(>1) vertices, each pair of distinct vertices connected by an edge, and also a graph obtained from such a graph by the process of subdividing edges through the insertion of new vertices of valency 2, will be denoted by ≪m, o≫. A graph obtained from a graph with m(>2) vertices in which each pair of distinct vertices are connected by an edge, by deleting n (≤ m-1) edges incident with one and the same vertex, and also a graph obtained from such a graph by the process of subdividing edges through the insertion of new vertices of valency 2, will be denoted by ≪m, n≫.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1965