首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Facially-constrained colorings of plane graphs: A survey
Authors:Július Czap  Stanislav Jendrol’
Institution:1. Department of Applied Mathematics and Business Informatics, Faculty of Economics, Technical University of Ko?ice, Němcovej 32, 040 01 Ko?ice, Slovakia;2. Institute of Mathematics, P. J. ?afárik University, Jesenná 5, 040 01 Ko?ice, Slovakia
Abstract:In this survey the following types of colorings of plane graphs are discussed, both in their vertex and edge versions: facially proper coloring, rainbow coloring, antirainbow coloring, loose coloring, polychromatic coloring, ?-facial coloring, nonrepetitive coloring, odd coloring, unique-maximum coloring, WORM coloring, ranking coloring and packing coloring.In the last section of this paper we show that using the language of words these different types of colorings can be formulated in a more general unified setting.
Keywords:Plane graph  Facial walk  Edge-coloring  Vertex-coloring
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号