Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) (Q477654)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with =9, 10, or 11 |
scientific article; zbMATH DE number 6378667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) |
scientific article; zbMATH DE number 6378667 |
Statements
Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) (English)
0 references
9 December 2014
0 references
combinatorial problems
0 references
planar bipartite graphs
0 references
adjacent-vertex-distinguishing proper edge coloring
0 references
adjacent-vertex-distinguishing proper edge chromatic number
0 references
0.8882079720497131
0 references
0.8659673929214478
0 references
0.8654435276985168
0 references
0.8573300242424011
0 references
