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


σ-polynomials and graph coloring
Authors:Robert R Korfhage
Affiliation:1. Department of Computer Science, Southern Methodist University, Dallas, Texas 75275 USA;2. Los Alamos Scientific Laboratory, University of California, Los Alamos, New Mexico 87545 USA
Abstract:A new class of graph polynomials is defined. Tight bounds on the coefficients of the polynomials are given, and the exact polynomials for several classes of graphs are derived. The relationship of these polynomials to chromatic polynomials and graph coloring is discussed.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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