On the chromatic number, colorings, and codes of the Johnson graph
From MaRDI portal
Publication:1923589
DOI10.1016/0166-218X(96)00104-7zbMath0863.05038MaRDI QIDQ1923589
Publication date: 20 May 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Combinatorial aspects of block designs (05B05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Combinatorial codes (94B25)
Related Items (15)
Treewidth of the generalized Kneser graphs ⋮ Regularity and planarity of token graphs ⋮ Uniquely \(K_r^{(k)}\)-saturated hypergraphs ⋮ The equidistant dimension of graphs ⋮ Edge-transitive token graphs ⋮ The Maximum k-Colorable Subgraph Problem and Related Problems ⋮ Token graphs ⋮ The connectivity of token graphs ⋮ On the Connectivity of Token Graphs of Trees ⋮ Large cycles in generalized Johnson graphs ⋮ Independence and matching numbers of some token graphs ⋮ Hamiltonicity of token graphs of fan graphs ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ The edge-connectivity of token graphs ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On large sets of disjoint Steiner triple systems. VI
- On large sets of disjoint Steiner triple systems. III
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- Optimal partitions for triples
- Partitions of triples into optimal packings
- The last packing number of quadruples, and cyclic SQS
- A new table of constant weight codes
- New lower bounds for constant weight codes
- Lower bounds for constant weight codes
- Towards a Large Set of Steiner Quadruple Systems
- Large sets of coverings
This page was built for publication: On the chromatic number, colorings, and codes of the Johnson graph
