Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) (Q477654): 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: 6378667 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
combinatorial problems | |||
| Property / zbMATH Keywords: combinatorial problems / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
planar bipartite graphs | |||
| Property / zbMATH Keywords: planar bipartite graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
adjacent-vertex-distinguishing proper edge coloring | |||
| Property / zbMATH Keywords: adjacent-vertex-distinguishing proper edge coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
adjacent-vertex-distinguishing proper edge chromatic number | |||
| Property / zbMATH Keywords: adjacent-vertex-distinguishing proper edge chromatic number / rank | |||
Normal rank | |||
Revision as of 18:24, 30 June 2023
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
