Edge coloring of planar graphs which any two short cycles are adjacent at most once (Q385973): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6237905 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
planar graph | |||
| Property / zbMATH Keywords: planar graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
edge coloring | |||
| Property / zbMATH Keywords: edge coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum degree | |||
| Property / zbMATH Keywords: maximum degree / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cycle | |||
| Property / zbMATH Keywords: cycle / rank | |||
Normal rank | |||
Revision as of 13:52, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge coloring of planar graphs which any two short cycles are adjacent at most once |
scientific article |
Statements
Edge coloring of planar graphs which any two short cycles are adjacent at most once (English)
0 references
13 December 2013
0 references
planar graph
0 references
edge coloring
0 references
maximum degree
0 references
cycle
0 references
