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

DOI10.1007/978-3-642-35261-4_7MaRDI QIDQ4909520zbMATH OpenOpenAlexFDO

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

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)

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

Cited in

(4)

• Reconfiguration of list \(L(2,1)\)-labelings in a graph
• Finding shortest paths between graph colourings
• Finding shortest paths between graph colourings
• On the graph relabeling problem

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)