Pages that link to "Item:Q1305534"
From MaRDI portal
The following pages link to Distance graphs and \(T\)-coloring (Q1305534):
Displaying 13 items.
- On the independence ratio of distance graphs (Q738864) (← links)
- The vertex linear arboricity of distance graphs (Q819822) (← links)
- A new approach for scheduling independent tasks with multiple modes (Q835753) (← links)
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
- Vertex arboricity of integer distance graph \(G(D_{m,k})\) (Q1024482) (← links)
- Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
- Circular chromatic numbers of some distance graphs (Q1773363) (← links)
- Circular chromatic numbers of distance graphs with distance sets missing multiples (Q1971805) (← links)
- On optimal \(M\)-sets related to Motzkin's problem (Q1983376) (← links)
- Coloring of distance graphs with intervals as distance sets (Q2567207) (← links)
- Maximal density of sets with missing differences and various coloring parameters of distance graphs (Q2663373) (← links)
- Distance Graphs Generated by Five Primes (Research) (Q5118660) (← links)
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs (Q6055514) (← links)
