On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span

DOI10.1016/J.DAM.2017.01.017zbMath1396.05061OpenAlexW2590640192MaRDI QIDQ1786890

Avishek Adhikari, Ushnish Sarkar

Publication date: 25 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.01.017

zbMATH Keywords

holeHamiltonian path\(L(3, 2, 1)\)-coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Triameter of graphs

Cites Work

• \(L(3,2,1)\)-labeling of triangular and toroidal grids
• Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
• The \(L(h,1,1)\)-labelling problem for trees
• A distance-labelling problem for hypercubes
• \(L(h,1,1)\)-labeling of outerplanar graphs
• Relating path coverings to vertex labellings with a condition at distance two
• No-hole \(L(2,1)\)-colorings
• Extremal problems on consecutive \(L(2,1)\)-labelling

This page was built for publication: On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span