On 3-colorable plane graphs without 5- and 7-cycles (Q859619): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A sufficient condition for planar graphs to be 3-colorable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3139765 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A 3-color theorem on plane graphs without 5-circuits / rank | |||
Normal rank | |||
Latest revision as of 12:38, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On 3-colorable plane graphs without 5- and 7-cycles |
scientific article |
Statements
On 3-colorable plane graphs without 5- and 7-cycles (English)
0 references
16 January 2007
0 references
coloring
0 references
