Optimal graphs for chromatic polynomials (Q2483402): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the greatest number of 2 and 3 colorings of a (v, e)-graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some corollaries of a theorem of Whitney on the chromatic polynomial / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Legal coloring of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coefficients of chromatic polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3819084 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with least number of colorings / rank | |||
Normal rank |
Latest revision as of 21:24, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal graphs for chromatic polynomials |
scientific article |
Statements
Optimal graphs for chromatic polynomials (English)
0 references
28 April 2008
0 references
chromatic polynomials
0 references
upper and lower bounds
0 references
bipartite graphs
0 references