The number of \(k\)-colorings of a graph on a fixed surface (Q856865): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56926684, #quickstatements; #temporary_batch_1718142333334 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Chromatic Polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4857375 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2726740 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Five-coloring graphs on the torus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every planar graph is 5-choosable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Color-critical graphs on a fixed surface / rank | |||
Normal rank |
Revision as of 10:36, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The number of \(k\)-colorings of a graph on a fixed surface |
scientific article |
Statements
The number of \(k\)-colorings of a graph on a fixed surface (English)
0 references
14 December 2006
0 references
chromatic polynomial
0 references
graphs on surfaces
0 references