Distance Graphs Generated by Five Primes (Research)
From MaRDI portal
Publication:5118660
Recommendations
- On a question concerning prime distance graphs
- On finite prime distance graphs
- On prime distance labeling of graphs
- Finite prime distance graphs and 2-odd graphs
- Prime power and prime product distance graphs
- A distance measure for large graphs based on prime graphs
- Distance Graphs on the Integers
- Colouring prime distance graphs
- On prime graphs
- Chromatic number of prime distance graphs
Cites work
- scientific article; zbMATH DE number 4099328 (Why is no real title available?)
- scientific article; zbMATH DE number 1275588 (Why is no real title available?)
- scientific article; zbMATH DE number 1792623 (Why is no real title available?)
- Chromatic number of prime distance graphs
- Chromatic numbers of integer distance graphs
- Circular chromatic number of distance graphs with distance sets of cardinality 3
- Circular chromatic number: A survey
- Circular chromatic numbers and fractional chromatic numbers of distance graphs
- Coloring of distance graphs with intervals as distance sets
- Coloring of integer distance graphs
- Colouring of distance graphs
- Colouring prime distance graphs
- Colouring the real line
- Distance graphs and \(T\)-coloring
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size
- From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
- Integral distance graphs
- On the chromatic number of special distance graphs
- Pattern periodic coloring of distance graphs
- Sets of integers with missing differences
- Sets of integers with missing differences
Cited in
(4)
This page was built for publication: Distance Graphs Generated by Five Primes (Research)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118660)