A criterion for the planarity of the total graph of a graph
Author:
- 1 July 1967
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 63 (3) , 679-681
Abstract
Two well-known numbers associated with a graph G (finite and undirected with no loops or multiple lines) are the (point) chromatic and the line chromatic number of G (see (2)). With G there is associated a graph L(G), called the line-graph of G, such that the line chromatic number of G is the same as the chromatic number of L(G). This concept was originated by Whitney (9) in 1932. In 1963, Sedlâček (8) characterized graphs with planar line-graphs. In this note we introduce the notions of the total chromatic number and the total graph of a graph, and characterize graphs with planar total graphs.Keywords
This publication has 5 references indexed in Scilit:
- The Colour Numbers of Complete GraphsJournal of the London Mathematical Society, 1967
- Theory of Graphs1962
- The Square of a TreeBell System Technical Journal, 1960
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932
- Sur le problème des courbes gauches en TopologieFundamenta Mathematicae, 1930