An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (Q1036905): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Acyclic edge colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) / 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: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex-distinguishing proper edge-colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Strong edge colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph colouring and the probabilistic method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adjacent strong edge coloring of graphs / rank | |||
Normal rank |
Latest revision as of 04:48, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph |
scientific article |
Statements
An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (English)
0 references
13 November 2009
0 references
adjacent strong edge coloring
0 references
adjacent vertex distinguishing acyclic edge coloring
0 references
adjacent vertex distinguishing acyclic edge chromatic number
0 references
the Lovász local lemma
0 references