Colouring of distance graphs
From MaRDI portal
Publication:2760982
zbMATH Open0977.05047MaRDI QIDQ2760982FDOQ2760982
Publication date: 17 December 2001
Published in: Ars Combinatoria (Search for Journal in Brave)
Cited In (27)
- The vertex linear arboricity of distance graphs
- Coloring of distance graphs with intervals as distance sets
- Powers of cycles, powers of paths, and distance graphs
- Circular chromatic numbers of some distance graphs
- Colouring prime distance graphs
- Title not available (Why is that?)
- Asymptotic clique covering ratios of distance graphs
- Fractional chromatic number of distance graphs generated by two-interval sets
- The distance coloring of graphs
- Title not available (Why is that?)
- Distant set distinguishing edge colourings of graphs
- Long cycles and paths in distance graphs
- Distance Graphs Generated by Five Primes (Research)
- Chromatic coloring of distance graphs \(\mathrm{V}\)
- On the chromatic number of circulant graphs
- Distance graphs and the \(T\)-coloring problem
- Distance graphs with maximum chromatic number
- Connectivity and diameter in distance graphs
- Sequences of integers with three missing separations
- On coloring the odd-distance graph
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- On Hamiltonian paths in distance graphs
- Title not available (Why is that?)
- Distance graphs and \(T\)-coloring
- Distance edge-colourings and matchings
- Pattern periodic coloring of distance graphs
- Maximal density of sets with missing differences and various coloring parameters of distance graphs
This page was built for publication: Colouring of distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760982)
