Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) (Q477654): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the vertex-distinguishing proper edge-colorings of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the neighbour-distinguishing index of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Adjacent strong edge coloring of graphs / rank | |||
Normal rank | |||
Revision as of 10:03, 9 July 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
