Distance Graphs on the Integers

DOI10.1017/S0963548304006637zbMath1061.05065OpenAlexW2146386721MaRDI QIDQ4660558

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)

Related Items (5)

Threshold-coloring and unit-cube contact representation of planar graphs ⋮ Integer sets with prescribed pairwise differences being distinct ⋮ Weak Unit Disk and Interval Representation of Graphs ⋮ Degree Sequence of Tight Distance Graphs ⋮ On the chromatic number of circulant graphs

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