A Important Property on Planar Graph

Na Na Li; Shu Jun Wang; Xian Rui Meng

doi:10.4028/www.scientific.net/AMM.50-51.245

Paper Titles

Convergence Theorems for Accretive Operators in Banach Spaces
p.224

The Working Principle of Multi-Layer Electromagnetic Screens and the Dynamics Analysis
p.229

Stability Analysis of Finite Element Method for Stokes Problem on Overlapping Non-Matching Grids
p.234

Estimation of Origin-Destination Matrix with Tolling Data
p.239

A Important Property on Planar Graph
p.245

Vacuum Casting Automatic Control System Based on Configuration Software
p.249

A Hyperchaotic System and its Synchronization via Scalar Controller
p.254

Generalized Projective Synchronization for a Class of Continuous Chaotic Systems
p.258

Solving Two-Person Zero-Sum Game by Matlab
p.262

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 50-51A Important Property on Planar Graph

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.

You might also be interested in these eBooks

Intelligent Structure and Vibration Control

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 50-51)

Pages:

245-248

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.50-51.245

Citation:

Cite this paper

Online since:

February 2011

Authors:

Na Na Li, Shu Jun Wang, Xian Rui Meng

Keywords:

(k, d)-Choosable, (L, d)-Colouring, Planar Graph

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] V.G. Vizing: Coloring the vertices of a graph in prescribed colors(in Russian). Diskret. Anal. Vol. 29(1976).

Google Scholar

[2] P. Erdos, A.L. Rubin and H. Taylor: Choosability in graphs, Congr. Numer. Vol. 26(1979).

Google Scholar

[3] C. Thomassen: Every planar graph is 5-choosable, J. Combin. Theory Ser. B Vol. 62(1994).

Google Scholar

[4] M. Voigt: List colourings of planar graphs, Discrete Math. Vol. 120(1993).

Google Scholar

[5] S. Gutner: The complexity of planar graph choosability, Discrete Math. Vol. 159(1996).

DOI: 10.1016/0012-365x(95)00104-5

Google Scholar

[6] M. Mirzakhani: A small non-4-choosable planar graph, Bull Inst. Combin. Appl. Vol. 17(1996).

Google Scholar

[7] R. · Skrekovski: List improper colourings of planar graphs, Combin. Prob. Comput. Vol. 8(1999).

Google Scholar

[8] N. Eaton and T. Hull: Defective list colorings of planar graphs, Bull Inst. Combin. Appl. Vol. 25(1999).

Google Scholar

[9] M. Voigt: Choosability of planar graphs, Discrete M ath. Vol. 150(1996).

Google Scholar

[10] D.R. Woodall: Defective choosability results for outerplanar and related graphs, Discrete Math. Vol. 258(2002).

DOI: 10.1016/s0012-365x(02)00300-x

Google Scholar

[11] D.R. Woodall: List colourings of graphs, Survey in combinatorics, 2001, London Math. Soc. Lecture Note Series 288, Cambridge University Press(2001).

Google Scholar