Pages that link to "Item:Q1923589"
From MaRDI portal
The following pages link to On the chromatic number, colorings, and codes of the Johnson graph (Q1923589):
Displayed 15 items.
- Uniquely \(K_r^{(k)}\)-saturated hypergraphs (Q1627212) (← links)
- Token graphs (Q1926040) (← links)
- The edge-connectivity of token graphs (Q2045395) (← links)
- Treewidth of the generalized Kneser graphs (Q2121803) (← links)
- The equidistant dimension of graphs (Q2147613) (← links)
- Edge-transitive token graphs (Q2166296) (← links)
- Regularity and planarity of token graphs (Q2364080) (← links)
- The connectivity of token graphs (Q2413643) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Independence and matching numbers of some token graphs (Q5109075) (← links)
- Hamiltonicity of token graphs of fan graphs (Q5198012) (← links)
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5918638) (← links)
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5925684) (← links)
- On the Connectivity of Token Graphs of Trees (Q6045414) (← links)
- Large cycles in generalized Johnson graphs (Q6084722) (← links)