Strongly n-e.c. graphs and independent distinguishing labellings

DOI10.1007/978-3-030-25070-6_4OpenAlexW2960283505MaRDI QIDQ6154909FDOQ6154909

Authors: Christopher Duffy, Jeannette Janssen 

Publication date: 16 February 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-25070-6_4

zbMATH Keywords

graph evolutiongraph distinguishing\(n\)-ordered graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

This page was built for publication: Strongly \(n\)-e.c. graphs and independent distinguishing labellings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154909)