Reconfiguration of List L(2,1)-Labelings in a Graph

DOI10.1007/978-3-642-35261-4_7zbMath1260.05136OpenAlexW92527438MaRDI QIDQ4909520

Hirotaka Ono, Kazuto Kawamura, Xiao Zhou, Takehiro Ito

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

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

Related Items (4)

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

This page was built for publication: Reconfiguration of List L(2,1)-Labelings in a Graph