Integral distance graphs

DOI10.1002/(SICI)1097-0118(199708)25:4%3C287::AID-JGT6%3E3.0.CO;2-GMaRDI QIDQ4351316zbMATH OpenOpenAlexFDO

Authors 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%3C287::aid-jgt6%3E3.0.co;2-g

zbMATH Keywords

chromatic numbercoloringdistance graphvertex

Mathematics Subject Classification ID

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

Recommendations

• Chromatic numbers of integer distance graphs
• Coloring of integer distance graphs
• Distance graphs with finite chromatic number
• Colouring of distance graphs
• scientific article; zbMATH DE number 2201392

Cited in

(47)

• On the chromatic number of circulant graphs
• Pattern periodic coloring of distance graphs
• On the chromatic number of special distance graphs
• Distance graphs and \(T\)-coloring
• On a question concerning prime distance graphs
• The chromatic numbers of distance graphs
• Every graph is an integral distance graph in the plane
• Coloring planar Toeplitz graphs and the stable set polytope.
• Asymptotic clique covering ratios of distance graphs
• Circular chromatic numbers of some distance graphs
• Distance graphs with finite chromatic number
• Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
• Circular chromatic numbers of distance graphs with distance sets missing multiples
• Vertex-colouring of 3-chromatic circulant graphs
• Structural properties of Toeplitz graphs
• Sequences of integers with three missing separations
• Bipartite finite Toeplitz graphs
• Distance graphs on \(\mathbb R^n\) with 1-norm
• Distance graphs with maximum chromatic number
• Coloring of distance graphs with intervals as distance sets
• Maximal density of sets with missing differences and various coloring parameters of distance graphs
• On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\)
• Colouring of distance graphs
• Coloring Toeplitz graphs
• Coloring integral distance graphs with finite distance sets
• scientific article; zbMATH DE number 4179396 (Why is no real title available?)
• scientific article; zbMATH DE number 4144005 (Why is no real title available?)
• Proof of a conjecture on fractional Ramsey numbers
• On planar Toeplitz graphs
• scientific article; zbMATH DE number 1735660 (Why is no real title available?)
• scientific article; zbMATH DE number 1452726 (Why is no real title available?)
• Distance Graphs on the Integers
• scientific article; zbMATH DE number 841654 (Why is no real title available?)
• Distance graphs from \(p\)-adic norms
• Distance Graphs Generated by Five Primes (Research)
• Chromatic number of graphs with special distance sets. I
• Distance Coloring of the Hexagonal Lattice
• Integral distances
• Chromatic numbers of integer distance graphs
• On the chromatic number of integral circulant graphs
• Chromatic coloring of distance graphs \(\mathrm{V}\)
• Fractional Chromatic Numbers and Chromatic Numbers for the Fibonacci Distance Graphs
• S-packing colorings of distance graphs with distance sets of cardinality 2
• On the independence ratio of distance graphs
• On Rado's boundedness conjecture
• Fractional chromatic number of distance graphs generated by two-interval sets
• \([r,s,t]\)-coloring of trees and bipartite graphs

This page was built for publication: Integral distance graphs

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