Theorems on Planar Graphs
Vedavathi N.1, Dharmaiah Gurram2
1Vedavathi, N., Asst. Professor of Mathematics in K.L. University, Guntur, (Andhra Pradesh), India.
2Dharmaiah Gurram, Asst. Professor of Mathematics in K.L. University, Guntur, (Andhra Pradesh), India.
Manuscript received on January 23, 2013. | Revised Manuscript received on February 10, 2013. | Manuscript published on February 28, 2013. | PP: 510-512 | Volume-2 Issue-3, February 2013. | Retrieval Number: C1203022313/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Graph coloring is a well-known and well-studied area of graph theory with many applications. In this paper, we will discuss list precoloring extensions.
Keywords: 5-list-coloring, 2-connected, P -separating 3-cycle.