Paper Title:
A Important Property on Planar Graph
  Abstract

In 1994, C.Thomassen proved that every planar graph is (namely ). In 1993, M.Voigt shown that there are planar graphs which are not . But no one know whether every planar graph is . In this paper, we give a important property on planar graph that “Every planar graph is ” and “Every planar graph is free ” are equivalent.

  Info
Periodical
Edited by
Shaobo Zhong, Yimin Cheng and Xilong Qu
Pages
245-248
DOI
10.4028/www.scientific.net/AMM.50-51.245
Citation
N. N. Li, S. J. Wang, X. R. Meng, "A Important Property on Planar Graph", Applied Mechanics and Materials, Vols. 50-51, pp. 245-248, 2011
Online since
February 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: G. Costa, M.J. Ribeiro, Tito Trindade, Joao A. Labrincha
Abstract:The preparation of ceramic pigments using industrial waste, a galvanizing sludge from the Cr/Ni plating process, as primary source is here...
2229
Authors: Chang Yong Chu
Chapter 3: E-Manufacturing, ERP, and Integrated Factory
Abstract:Two graphs are introduced to describe the precedence and cluster constraints among stamping operations, i.e., operation precedence graph and...
564
Authors: Hidekazu Yasunaga
Abstract:Novel colouring techniques by using biobased materials were studied. The orange or reddish orange colourant is obtained from (+)-catechin by...
28
Authors: Liang Zhen Pei, Xin Zhong Lu, Ji Xian Meng, Feng Xu
Chapter 5: Electronic Communication Engineering and Electrical Automation Engineering
Abstract:In wireless networks, implementing repeaters can improve network capacity and CCTSS systems can be used to mitigate interference. This paper...
1106
Authors: Jaroslava Koťátková, Pavel Reiterman
Abstract:In this paper the possibilities of colouring concrete and the use of pigments are presented. There are two groups of pigments with respect to...
248