Pair Labellings with Given Distance

DOI10.1137/0402044MaRDI QIDQ3348926zbMATH OpenOpenAlexFDO

Authors Zoltán Füredi, J. Griggs, 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

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

Recommendations

• Pair Labelings of Graphs
• \(L(2,l)\)-labellings of integer distance graphs
• On \(L(2,1)\)-labellings of distance graphs
• Distance-two labellings of Hamming graphs
• Distance labellings of graphs

Cited in

(15)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348926)