Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) (Q477654): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2014.09.025 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2014.09.025 / rank | |||
Normal rank | |||
Latest revision as of 18:41, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) |
scientific article |
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
