Chromatic coloring of distance graphs \(\mathrm{V}\)
From MaRDI portal
Publication:6625099
DOI10.61091/jcmcc122-26MaRDI QIDQ6625099
Bryan Freyberg, Unnamed Author, Yegnanarayanan Venkataraman
Publication date: 28 October 2024
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite prime distance graphs and 2-odd graphs
- Colouring the real line
- Colouring prime distance graphs
- Pattern periodic coloring of distance graphs
- On the chromatic number of special distance graphs
- Distance graphs and \(T\)-coloring
- Chromatic number of prime distance graphs
- On a question concerning prime distance graphs
- The chromatic numbers of distance graphs
- Coloring of integer distance graphs
- Integral distance graphs
- The chromatic number of the plane is at least 5
- Computing Small Unit-Distance Graphs with Chromatic Number 5
- Chromatic coloring of distance graphs, III
This page was built for publication: Chromatic coloring of distance graphs \(\mathrm{V}\)