Extremal problems on consecutive \(L(2,1)\)-labelling

DOI10.1016/J.DAM.2006.12.002zbMath1125.05090DBLPjournals/dam/LuCZ07OpenAlexW2029286546WikidataQ60630633 ScholiaQ60630633MaRDI QIDQ2370429

Lei Chen, Ming-qing Zhai, Chang-hong Lu

Publication date: 26 June 2007

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

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

zbMATH Keywords

channel assignmentHamiltonian graphsdistance-two labelling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

An extremal problem on non-full colorable graphs ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ On the universality and extremality of graphs with a distance constrained colouring ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ A note on \(L (2, 1)\)-labelling of trees ⋮ On island sequences of labelings with a condition at distance two ⋮ On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• No-hole \((r+1)\)-distant colorings
• \(T\)-colorings of graphs: recent results and open problems
• No-hole 2-distant colorings
• Relating path coverings to vertex labellings with a condition at distance two
• No-hole \(L(2,1)\)-colorings
• No-hole \(k\)-tuple \((r+1)\)-distant colorings
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Minimum Span of No-Hole (r+1)-Distant Colorings
• Note on Hamilton Circuits
• Full Color Theorems for L(2,1)-Colorings
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• The $L(2,1)$-Labeling Problem on Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Extremal problems on consecutive \(L(2,1)\)-labelling