[图书][B] Chromatic polynomials and chromaticity of graphs
FM Dong, KM Koh, KL Teo - 2005 - books.google.com
" 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 …
most of the known results and unsolved problems in the area of chromatic polynomials …
[PDF][PDF] О хроматической определяемости некоторых классов трехдольных графов, хроматических инвариантах и решётках разбиений натуральных чисел
ПА Гейн - imm.uran.ru
Теория раскрасок графов ведет свое начало с задачи о четырех красках. В 1852 году
Френсис Гутри заметил, что достаточно четырех цветов чтобы раскрасить карту …
Френсис Гутри заметил, что достаточно четырех цветов чтобы раскрасить карту …
[PDF][PDF] On the chromatic uniqueness of edge-gluing of complete tripartite graphs and cycles
On the Chromatic Uniqueness of Edge-Gluing of Complete Tripartite Graphs and Cycles
Page 1 BULLETIN of the Bull. Malaysian Math. Sc. Soc. (Second Series) 26 (2003) 87−92 …
Page 1 BULLETIN of the Bull. Malaysian Math. Sc. Soc. (Second Series) 26 (2003) 87−92 …
[PDF][PDF] A result on chromatic uniqueness of edge-gluing of graphs
In this paper, it is shown that the graph obtained by overlapping the cycle C,(m> 3) and the
complete bipartite graph Ka, a at an edge is uniquely determined by its chromatic …
complete bipartite graph Ka, a at an edge is uniquely determined by its chromatic …
[HTML][HTML] Chromaticity of certain tripartite graphs identified with a path
GC Lau, YH Peng - Discrete mathematics, 2006 - Elsevier
For a graph G, let P (G) be its chromatic polynomial. Two graphs G and H are chromatically
equivalent if P (G)= P (H). A graph G is chromatically unique if P (H)= P (G) implies that H≅ …
equivalent if P (G)= P (H). A graph G is chromatically unique if P (H)= P (G) implies that H≅ …
Chromatic uniqueness of certain tripartite graphs identified with a path
GC Lau, YH Peng - Sains Teknologi Jilid1, 2004 - ir.uitm.edu.my
For a graph G, let P (G) be its chromatic polynomial. Two graphs G and H are chromatically
equivalent if P (G)= P (H). A graph G is chromatically unique if P (H)= P (G) implies that H …
equivalent if P (G)= P (H). A graph G is chromatically unique if P (H)= P (G) implies that H …