Pair Labellings with Given Distance

DOI10.1137/0402044zbMath0727.05022OpenAlexW2042077324MaRDI QIDQ3348926

Jerrold R. Griggs, Zoltan Fueredi, Daniel J. Kleitman

Publication date: 1989

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://purl.umn.edu/4854

zbMATH Keywords

distance between setst-labelling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (12)

Pair \(L(2, 1)\)-labelings of infinite graphs ⋮ The complexity of restricted graph homomorphisms ⋮ No-hole \(k\)-tuple \((r+1)\)-distant colorings ⋮ No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles ⋮ Distance-two labelings of digraphs ⋮ \(T\)-colorings of graphs: recent results and open problems ⋮ Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube ⋮ A note on restricted \(H\)-colouring ⋮ On the restricted homomorphism problem ⋮ \(T\)-colorings of graphs ⋮ No-hole \((r+1)\)-distant colorings ⋮ \(L(j,k)\)-labelling and maximum ordering-degrees for trees

This page was built for publication: Pair Labellings with Given Distance