Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings (Q2673487): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3197582057 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2108.12669 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Chromatic Polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Planar 4-critical graphs with four triangles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Many 3-colorings of triangle-free planar graphs / rank | |||
Normal rank | |||
Latest revision as of 07:27, 29 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings |
scientific article |
Statements
Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings (English)
0 references
10 June 2022
0 references
triangle-free
0 references
number of colorings
0 references
