\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number (Q2573644): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055120783 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0701012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(r\)-strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-distinguishing edge colorings of graphs / 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: Asymptotic behaviour of the observability of \(Q_ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:18, 11 June 2024

scientific article
Language Label Description Also known as
English
\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
scientific article

    Statements