On vertex-distinguishing edge colorings of graphs
From MaRDI portal
Publication:2799880
zbMATH Open1338.05080MaRDI QIDQ2799880
Ping Zhang, Daniel Johnston, Elliot Laforge, Sean English
Publication date: 13 April 2016
Published in: Congressus Numerantium (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (13)
A Vizing-like theorem for union vertex-distinguishing edge coloring ⋮ Distant set distinguishing edge colourings of graphs ⋮ Title not available (Why is that?) ⋮ On the vertex-distinguishing proper edge coloring of composition of complete graph and star ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Vertex colouring edge partitions ⋮ Title not available (Why is that?) ⋮ New concepts on vertex and edge coloring of simple vague graphs ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?)
This page was built for publication: On vertex-distinguishing edge colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799880)
