On the graph relabeling problem

MaRDI QIDQ2996615zbMATH OpenFDO

Authors Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra

Publication date 3 May 2011

zbMATH Keywords

Cayley graphgraph labelingpermutationsimple graphsymmetric group

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Applications of graph theory (05C90) Symmetric groups (20B30) Subgroups of symmetric groups (20B35)

Recommendations

• On the hardness of optimal vertex relabeling and restricted vertex relabeling
• Fast sequential and parallel vertex relabelings of \({K_{m,m}}\)
• scientific article; zbMATH DE number 1026280
• Isomorphism of (mis)Labeled Graphs
• Reconfiguration of list \(L(2,1)\)-labelings in a graph

Cited in

(2)

• On the hardness of optimal vertex relabeling and restricted vertex relabeling
• Fast sequential and parallel vertex relabelings of \({K_{m,m}}\)

This page was built for publication: On the graph relabeling problem

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