Minimum Number of Edges whose Removal Gives a Planar Graph

Article Sidebar

PDF
Published: Mar 30, 2014
Keywords:
Graph Planar graph Complete graph Complete k-partite graph

Main Article Content

Keaitsuda Nakprasit
Department of Mathematics, Faculty of Science, Khon Kaen University, Thailand 40002
Weenakorn Ieosanurak
Department of Mathematics, Faculty of Science, Khon Kaen University, Thailand 40002

Abstract

Let Ce(G) be the minimum number of edges whose removal from a graph G gives a planar graph. We investigate Ce(G) for complete graphs and complete k-partite graphs. 

Article Details

How to Cite
Nakprasit, K., & Ieosanurak, W. (2014). Minimum Number of Edges whose Removal Gives a Planar Graph. KKU Science Journal, 42(1), 248–261. Retrieved from https://ph01.tci-thaijo.org/index.php/KKUSciJ/article/view/249258
Issue
Vol. 42 No. 1 (2014): January - March 2014
Section
Research Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.