Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6352220 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Steinberg's conjecture | |||
| Property / zbMATH Keywords: Steinberg's conjecture / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
weak Bordeaux conjecture | |||
| Property / zbMATH Keywords: weak Bordeaux conjecture / rank | |||
Normal rank | |||
Revision as of 12:17, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph |
scientific article |
Statements
Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (English)
0 references
8 October 2014
0 references
Steinberg's conjecture
0 references
weak Bordeaux conjecture
0 references
