On chromatic polynomials of some kinds of graphs (Q705078): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10255-004-0164-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2045331084 / rank | |||
Normal rank |
Revision as of 21:34, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On chromatic polynomials of some kinds of graphs |
scientific article |
Statements
On chromatic polynomials of some kinds of graphs (English)
0 references
25 January 2005
0 references
Let \(D_n\) be the graph consisting of \(K_3\) (a triangle) and the path \(P_{n-2}\) with \(n-2\) vertices, by coinciding a vertex of \(K_3\) with a vertex of degree \(l\) of \(P_{n-2}\). By \(F_n\), \(n\geq 6\), we mean the graph obtained from \(D_{n-2}\) and \(K_3\) by coinciding the vertex of degree \(l\) of \(D_{n-2}\) with a vertex of \(K_3\). A new method is used to calculate the chromatic polynomials of graphs. The chromatic polynmial of the complements of a wheel, a fan and the adjoint polynomials of \(F_n\) are obtained. It may be conjectured that the \(F_n\) are reducible for any odd \(n\).
0 references
wheel
0 references
fan
0 references