Integral distance graphs
From MaRDI portal
Publication:4351316
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199708)25:4<287::AID-JGT6>3.0.CO;2-G" /><287::AID-JGT6>3.0.CO;2-G 10.1002/(SICI)1097-0118(199708)25:4<287::AID-JGT6>3.0.CO;2-GzbMath0878.05028OpenAlexW2086632402MaRDI QIDQ4351316
Jer-Jeong Chen, Kuo-Ching Huang, Gerard Jennhwa Chang
Publication date: 7 December 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199708)25:4<287::aid-jgt6>3.0.co;2-g
Related Items (26)
Asymptotic clique covering ratios of distance graphs ⋮ Coloring Toeplitz graphs ⋮ Structural properties of Toeplitz graphs ⋮ On planar Toeplitz graphs ⋮ Maximal density of sets with missing differences and various coloring parameters of distance graphs ⋮ On the chromatic number of integral circulant graphs ⋮ Pattern periodic coloring of distance graphs ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ Coloring planar Toeplitz graphs and the stable set polytope. ⋮ Bipartite finite Toeplitz graphs ⋮ Circular chromatic numbers of distance graphs with distance sets missing multiples ⋮ Proof of a conjecture on fractional Ramsey numbers ⋮ Fractional chromatic number of distance graphs generated by two-interval sets ⋮ Distance graphs on \(\mathbb R^n\) with 1-norm ⋮ Distance graphs with maximum chromatic number ⋮ \([r,s,t\)-coloring of trees and bipartite graphs] ⋮ Vertex-colouring of 3-chromatic circulant graphs ⋮ Circular chromatic numbers of some distance graphs ⋮ On the independence ratio of distance graphs ⋮ Sequences of integers with three missing separations ⋮ On the chromatic number of circulant graphs ⋮ Coloring of distance graphs with intervals as distance sets ⋮ Distance graphs and \(T\)-coloring ⋮ On Rado's boundedness conjecture
This page was built for publication: Integral distance graphs
