On island sequences of labelings with a condition at distance two

DOI10.1016/j.dam.2009.08.005zbMath1226.05208OpenAlexW1993698079MaRDI QIDQ968105

Alex Trazkovich, Denise Sakai Troxell, Sarah Spence Adams, Bradford S. Westgate

Publication date: 5 May 2010

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

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

zbMATH Keywords

path covering number\(L(2,1)\)-labeling\(L(2,1)\)-coloringhole index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Labeling matched sums with a condition at distance two ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs

Cites Work

• Unnamed Item
• Relating path coverings to vertex labellings with a condition at distance two
• No-hole \(L(2,1)\)-colorings
• A note on collections of graphs with non-surjective lambda labelings
• Extremal problems on consecutive \(L(2,1)\)-labelling
• An extremal problem on non-full colorable graphs
• On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs
• A survey on labeling graphs with a condition at distance two
• Full Color Theorems for L(2,1)-Colorings
• Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
• Labelling Graphs with a Condition at Distance 2
• On the optional hamiltonian completion problem
• Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
• On the Structure of Graphs with Non-Surjective L(2,1)-Labelings

This page was built for publication: On island sequences of labelings with a condition at distance two