Chromatic polynomials and chromaticity of graphs
著者
書誌事項
Chromatic polynomials and chromaticity of graphs
World Scientific, c2005
- : pbk
大学図書館所蔵 件 / 全17件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 327-352) and index
内容説明・目次
内容説明
This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book into three main parts, the authors take readers from the rudiments of chromatic polynomials to more complex topics: the chromatic equivalence classes of graphs and the zeros and inequalities of chromatic polynomials. The early material is well suited to a graduate level course while the latter parts will be an invaluable resource for postgraduate students and researchers in combinatorics and graph theory.
目次
# The Number of -Colourings and Its Enumerations # Chromatic Polynomials # Chromatic Equivalence of Graphs # Chromaticity of Multi-Partite Graphs # Chromaticity of Subdivisions of Graphs # Graphs in Which any Two Colour Classes Induce a Tree # Graphs in Which All but One Pair of Colour Classes Induce Trees # Chromaticity of Extremal 3-Colorable Graphs # Polynomials Related to Chromatic Polynomials # Real Roots of Chromatic Polynomials # Integral Roots of Chromatic Polynomials # Complex Roots of Chromatic Polynomials # Inequalities on Chromatic Polynomials
「Nielsen BookData」 より