scientific article; zbMATH DE number 1275588
From MaRDI portal
Publication:4238040
DOI<245::AID-JGT1>3.0.CO;2-S 10.1002/(SICI)1097-0118(199904)30:4<245::AID-JGT1>3.0.CO;2-SzbMath0915.05056MaRDI QIDQ4238040
Daphne Der-Fen Liu, Xuding Zhu
Publication date: 23 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (13)
Asymptotic clique covering ratios of distance graphs ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ Proof of a conjecture on fractional Ramsey numbers ⋮ Fractional chromatic number of distance graphs generated by two-interval sets ⋮ On optimal \(M\)-sets related to Motzkin's problem ⋮ Circular chromatic numbers of some distance graphs ⋮ On the independence ratio of distance graphs ⋮ Sequences of integers with three missing separations ⋮ Vertex arboricity of integer distance graph \(G(D_{m,k})\) ⋮ On the chromatic number of circulant graphs ⋮ Coloring of distance graphs with intervals as distance sets ⋮ Distance graphs and \(T\)-coloring
This page was built for publication:
