Distance Graphs on the Integers

DOI10.1017/S0963548304006637MaRDI QIDQ4660558zbMATH OpenOpenAlexFDO

Authors Michael Ferrara, Yoshiharu Kohayakawa, Vojtěch Rödl

Publication date 4 April 2005

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548304006637

zbMATH Keywords

distance graphextremal problemsgraph representation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Integral distance graphs
• Colouring of distance graphs
• Every graph is an integral distance graph in the plane
• Chromatic numbers of integer distance graphs
• scientific article; zbMATH DE number 4196001

Cited in

(11)

• On the chromatic number of circulant graphs
• Every graph is an integral distance graph in the plane
• Integer sets with prescribed pairwise differences being distinct
• Weak unit disk and interval representation of graphs
• Degree sequence of tight distance graphs
• Threshold-coloring and unit-cube contact representation of planar graphs
• scientific article; zbMATH DE number 1275588 (Why is no real title available?)
• scientific article; zbMATH DE number 841654 (Why is no real title available?)
• Distance Graphs Generated by Five Primes (Research)
• scientific article; zbMATH DE number 4196001 (Why is no real title available?)
• On the graph of large distances

This page was built for publication: Distance Graphs on the Integers

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