Pages that link to "Item:Q2243705"
From MaRDI portal
The following pages link to New bounds for the clique-chromatic numbers of Johnson graphs (Q2243705):
Displaying 8 items.
- Lower bounds on the clique-chromatic numbers of some distance graphs (Q2043671) (← links)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
- Coverings of planar and three-dimensional sets with subsets of smaller diameter (Q2166237) (← links)
- On the independence number and the chromatic number of generalized preferential attachment models (Q2197436) (← links)
- Exact modularity of line graphs of complete graphs (Q2229338) (← links)
- New lower bound on the modularity of Johnson graphs (Q2229339) (← links)
- Covering planar sets (Q5919143) (← links)
- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs (Q6604699) (← links)
