On the independence ratio of distance graphs
From MaRDI portal
Publication:738864
DOI10.1016/j.disc.2016.05.018zbMath1343.05055arXiv1401.7183OpenAlexW1572592322MaRDI QIDQ738864
Derrick Stolee, Stephen G. Hartke, James M. Carraher, David Galvin, Andrew John Radcliffe
Publication date: 16 August 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.7183
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Domination ratio of a family of integer distance digraphs with arbitrary degree ⋮ Domination ratio of integer distance digraphs ⋮ On optimal \(M\)-sets related to Motzkin's problem ⋮ Sequences of integers with three missing separations ⋮ Maximal density of integral sets with missing differences and the kappa values
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing chromatic number of distance graphs
- On the chromatic number of integral circulant graphs
- The energy of unitary Cayley graphs
- Colouring the real line
- Some colouring problems for Paley graphs
- Colouring prime distance graphs
- From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
- On the clique number of integral circulant graphs
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- Circular chromatic numbers and fractional chromatic numbers of distance graphs
- Distance graphs and \(T\)-coloring
- The chromatic numbers of distance graphs
- Maximal cliques in the Paley graph of square order
- On planarity and colorability of circulant graphs
- Distance-regular circulants
- Coloring of integer distance graphs
- Distance graphs with finite chromatic number
- Star-extremal graphs and the lexicographic product
- Uniquely \(K_r\)-saturated graphs
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- Some properties of unitary Cayley graphs
- Counting sets with small sumset, and the clique number of random Cayley graphs
- The packing coloring of distance graphs \(D(k,t)\)
- On packing colorings of distance graphs
- Bounds for Ramsey numbers of complete graphs dropping an edge
- Distance graphs with maximum chromatic number
- Coloring of distance graphs with intervals as distance sets
- CLIQUE NUMBERS OF PALEY GRAPHS
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size
- Proof of a conjecture on fractional Ramsey numbers
- THE CLIQUE NUMBERS AND CHROMATIC NUMBERS OF CERTAIN PALEY GRAPHS
- Integral distance graphs
- Circulants and Sequences
- Star Extremal Circulant Graphs
- Circular chromatic number of distance graphs with distance sets of cardinality 3
- Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence
This page was built for publication: On the independence ratio of distance graphs
