This material is dedicated to the estimation of the chromatic number and chromatic class of the conjugated triangulation (first conversion) and also of the second conversion of the planar triangulation. Also this paper introduces some new hypotheses, which are equivalen... View more
 Berge, C.: Theore des graphes et ses applications, DUNOD, Paris, (1958), 319.
 Brooks, R.: On coloring the nodes of a network, Proc. Cambridge Philos. Soc., 6 (37), (1941), 194-197.
 Chrisofides, N.: Graph Theory. An Algorithmic approach, Academic Press, London, New York, Paris (1975), 429.
 A. A. Zukov. Theory of nite graphs. Science, Novosibirsk (1969)
 Welsh, D.J.A., Powel, M.B.: An upper bond on the chromatic number of a graph and its application to timetabling problem, The Computer Journal, 10, (1967), 85.
 Szekeres, G., Wilf, H.S.: An inequelity for the chromatic number of a graph, Journal of Combinatorial Theory, 4, (1968), 1-12.
 Shannon, C., Weaver, W.: A theorem on coloring the lines of a network, Journal Math. and Phys., 28, (1949), 148-151
 Shannon, C., Weaver, W.: The Mathematical Theory of Communication, Urbana, Illinois, USA: The University of Illinois Press. (1949)
 Malinina, N.: The equation of the existence for the planar triangulation, ReaserchGate: https://www.researchgate.net/publication/252932560, 27p., 2013 (Moscow Aviation Institute (National Research University), 4, Volocolamskiy Shosse, Moscow, GCP-4, Russian Federation)