On 3-colouring of graphs with short faces and bounded maximum vertex degree (Q2030141): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: 3-Colorability of Pseudo-Triangulations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5782525 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity for constructing a 3-colouring for planar graphs with short facets / rank | |||
Normal rank | |||
Revision as of 22:36, 25 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On 3-colouring of graphs with short faces and bounded maximum vertex degree |
scientific article |
Statements
On 3-colouring of graphs with short faces and bounded maximum vertex degree (English)
0 references
7 June 2021
0 references
3-colourability
0 references
planar graph
0 references
computational complexity
0 references
