Reconfiguration of list L(2,1)-labelings in a graph

DOI10.1007/978-3-642-35261-4_7zbMATH Open1260.05136OpenAlexW92527438MaRDI QIDQ4909520FDOQ4909520

Authors: Takehiro Ito, K. Kawamura, Hirotaka Ono, Xiao Zhou 

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_7

Recommendations

• Reconfiguration of list \(L(2,1)\)-labelings in a graph
• Reconfiguration of list edge-colorings in a graph
• Reconfiguration of List Edge-Colorings in a Graph
• The list coloring reconfiguration problem for bounded pathwidth graphs
• List version of \(L(d,s)\)-labelings

zbMATH Keywords

list labelinglist reconfiguration

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (5)

• On the graph relabeling problem
• Reconfiguration of dominating sets
• Finding shortest paths between graph colourings
• Reconfiguration of list \(L(2,1)\)-labelings in a graph
• Finding Shortest Paths Between Graph Colourings

This page was built for publication: Reconfiguration of list \(L(2,1)\)-labelings in a graph

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