Some Problems in Total Graph Theory
Thirty years ago the total chromatic number and the total graph of a graph was introduced and a conjecture was stated in the author’s Ph.D. dissertation. This conjecture is known as the Total Chromatic Coiyecture (TCC). At this time numerous results concerning these and other total concepts such as total groups, total crossing numbers, and total Ramsey numbers exist in the literature. More specifically, during these decades results concerning different properties of total graphs, such as planarity, reconstructibility, and traversability have been obtained, and some parameters, including (vertex) connectivity, edge connectivity, arboricity, and eigenvalues, of such graphs have been studied. Some total concepts have been generalized, and some have been applied to other areas. In recent years a lot of attention has been paid to TCC and tremendous effort is being used toward its settlement. In this brief expository article we confine ourselves to some concepts and questions which are tangible even by some bright undergraduate students. As far as references are concerned, as usual, there are a lot of duplications. For the sake of briefness we have to be selective, and, with apology, we eliminate a lot of articles and results.
KeywordsChromatic Number Balance Incomplete Block Design Edge Connectivity Chromatic Polynomial Total Graph
Unable to display preview. Download preview PDF.
- M. Behzad, Graphs and their chromatic numbers, PhD dissertation, Michigan State University, Department of Mathematics, 1965.Google Scholar
- M. Behzad, The total chromatic number of a graph, a survey, in Comb. Math. and its Applications, D. J. A. Welsh, ed., Acad. Press, 1971, pp. 1–9.Google Scholar
- M. Behzad, An introduction to total graphs, in Proc. of the Inter. Symposium on Theory of Graphs, Rome, 1967, pp. 31–33.Google Scholar
- M. Behzad, G. Chartrand, and L. Lesniak-Foster, Graphs and Digraphs, Wadsworth International Group, Belmont,California, 1979.Google Scholar
- M. Behzad and E. S. Mahmoodian, Graphs versus designs: A quasisurvey, in Graph Theory, Combinatorics, and Applications, Y. Alavi and et al, eds., John Wiley and Sons, Inc., 1991, pp. 125–141.Google Scholar
- A. G. Chetwynd, Total colorings of graphs-a progress report, in Graph Colorings, R. Nelson and R. J. Wilson, eds., Research Notes in Mathematics, Pitman, 1990, pp. 65–77.Google Scholar
- A. J. W. Hilton, Recent results on the total chromatic number, Discrete Math., III (1993), pp. 323–331.Google Scholar
- H. R. Hind, A summary of total coloring results. Preprint, May 29 1991.Google Scholar
- I. Krasikŏv and Y. Roditty, Recent applications of Nash-Williams lemma to the edge-reconstruction conjecture, Ars Comb., Ser. A, 29 (1990), pp. 215–224.Google Scholar
- C. J. H. McDiarmid and A. Sanchéz-Arroyo, An upper bound for total colouring of graphs. Discrete Math., III (1993), pp. 389–392.Google Scholar
- C. St. J. A. Nash-Williams, The reconstruction problem, in Selected Topics in the Theory of Graphs, L. W. Beineke and R. J. Wilson, eds., Academic Press, 1978.Google Scholar
- H. P. Yap, On the total chromatic number of a graph, Research Report No. 343, 1988.Google Scholar