Pages that link to "Item:Q1212006"
From MaRDI portal
The following pages link to n-tuple colorings and associated graphs (Q1212006):
Displayed 16 items.
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Graph homomorphisms via vector colorings (Q2422244) (← links)
- Independence and coloring properties of direct products of some vertex-transitive graphs (Q2509308) (← links)
- On the diameter of Kneser graphs (Q2581434) (← links)
- Exact and Parameterized Algorithms for (k, i)-Coloring (Q2971658) (← links)
- k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS (Q3087093) (← links)
- Homology as a Tool in Integer Programming (Q3714903) (← links)
- Graph Information Ratio (Q4599114) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- (Q5092401) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
- (Q5870293) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
- On multichromatic numbers of widely colorable graphs (Q6081566) (← links)
- Acyclic coloring of products of digraphs (Q6130210) (← links)