Vertex‐distinguishing edge colorings of random graphs

DOI10.1002/RSA.10002zbMath1002.05022OpenAlexW2158850746MaRDI QIDQ4534220

Paul N. Balister

Publication date: 5 June 2002

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10002

zbMATH Keywords

edge coloringrandom graphvertex-distinguishing coloring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Vertex-distinguishing proper arc colorings of digraphs ⋮ Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Vertex-distinguishing proper edge colourings of some regular graphs ⋮ An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph

Cites Work

• Unnamed Item

This page was built for publication: Vertex‐distinguishing edge colorings of random graphs