Distance Graphs Generated by Five Primes (Research)

DOI10.1007/978-3-030-42687-3_3zbMath1440.05079OpenAlexW3043257817MaRDI QIDQ5118660

Grant Robinson, Daphne Der-Fen Liu, Angel Chavez

Publication date: 26 August 2020

Published in: Advances in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-42687-3_3

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Special sequences and polynomials (11B83)

Related Items (1)

Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colouring the real line
• Colouring prime distance graphs
• From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
• Pattern periodic coloring of distance graphs
• On the chromatic number of special distance graphs
• Circular chromatic numbers and fractional chromatic numbers of distance graphs
• Distance graphs and \(T\)-coloring
• Chromatic number of prime distance graphs
• Coloring of integer distance graphs
• Coloring of distance graphs with intervals as distance sets
• Fractional chromatic number and circular chromatic number for distance graphs with large clique size
• Integral distance graphs
• Circular chromatic number of distance graphs with distance sets of cardinality 3
• Sets of integers with missing differences
• Sets of integers with missing differences
• Circular chromatic number: A survey
• Chromatic numbers of integer distance graphs

This page was built for publication: Distance Graphs Generated by Five Primes (Research)