Pages that link to "Item:Q1212006"

The following pages link to n-tuple colorings and associated graphs (Q1212006):

Displayed 50 items.

• Connectivity and other invariants of generalized products of graphs (Q313405) ‎ (← links)
• \(k\)-tuple chromatic number of the Cartesian product of graphs (Q324798) ‎ (← links)
• Colorful subhypergraphs in Kneser hypergraphs (Q405073) ‎ (← links)
• On the interval of strong partial clones of Boolean functions containing \(\mathrm{Pol}(\{(0, 0), (0, 1), (1, 0)\})\) (Q509534) ‎ (← links)
• Hedetniemi's conjecture for Kneser hypergraphs (Q530765) ‎ (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) ‎ (← links)
• Kneser's conjecture, chromatic number, and homotopy (Q755592) ‎ (← links)
• \(b\)-coloring of Kneser graphs (Q765331) ‎ (← links)
• A note on the Poljak-Rödl function (Q782938) ‎ (← links)
• Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton (Q801930) ‎ (← links)
• Colouring lines in projective space (Q817609) ‎ (← links)
• Induced-path partition on graphs with special blocks (Q868947) ‎ (← links)
• Extending Hall's theorem into list colorings: a partial history (Q925374) ‎ (← links)
• Multicoloring and Mycielski construction (Q932681) ‎ (← links)
• On the diameter of generalized Kneser graphs (Q941359) ‎ (← links)
• On the topological lower bound for the multichromatic number (Q965996) ‎ (← links)
• Grundy number and products of graphs (Q968418) ‎ (← links)
• Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs (Q1044992) ‎ (← links)
• Extremal problems concerning Kneser-graphs (Q1057858) ‎ (← links)
• The complexity of multicolouring (Q1113919) ‎ (← links)
• Permutation-partition pairs. III: Embedding distributions of linear families of graphs (Q1119660) ‎ (← links)
• Generalized k-tuple colorings of cycles and other graphs (Q1154475) ‎ (← links)
• Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) ‎ (← links)
• \(T\)-colorings of graphs: recent results and open problems (Q1182897) ‎ (← links)
• On the ratio of optimal integral and fractional covers (Q1224109) ‎ (← links)
• r-tuple colorings of uniquely colorable graphs (Q1230631) ‎ (← links)
• Fractional multiples of graphs and the density of vertex-transitive graphs (Q1296389) ‎ (← links)
• Strong products of Kneser graphs (Q1336712) ‎ (← links)
• On the chromatic number of the lexicographic product and the Cartesian sum of graphs (Q1339858) ‎ (← links)
• On fractional Ramsey numbers (Q1377687) ‎ (← links)
• Graph products and the chromatic difference sequence of vertex-transitive graphs (Q1584242) ‎ (← links)
• The multichromatic numbers of some Kneser graphs (Q1584256) ‎ (← links)
• On the fractional chromatic number and the lexicographic product of graphs (Q1584257) ‎ (← links)
• Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) ‎ (← links)
• \(k\)-tuple colorings of the Cartesian product of graphs (Q1752494) ‎ (← links)
• Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619) ‎ (← links)
• NP-completeness of a family of graph-colouring problems (Q1835680) ‎ (← links)
• The chromatic numbers of graph bundles over cycles (Q1842173) ‎ (← links)
• Chromatic invariants for finite graphs: Theme and polynomial variations (Q1899442) ‎ (← links)
• Star-extremal graphs and the lexicographic product (Q1917490) ‎ (← links)
• Coloring graph products---a survey (Q1923489) ‎ (← links)
• Multiple \(L(j,1)\)-labeling of the triangular lattice (Q2015807) ‎ (← links)
• On the multiple Borsuk numbers of sets (Q2017114) ‎ (← links)
• Note on Hedetniemi's conjecture and the Poljak-Rödl function (Q2058954) ‎ (← links)
• Planar graphs without 4- and 6-cycles are (7 : 2)-colorable (Q2185814) ‎ (← links)
• Proof of Stahl's conjecture in some new cases (Q2197410) ‎ (← links)
• On the tractability of \(( k , i )\)-coloring (Q2235289) ‎ (← links)
• A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function (Q2278108) ‎ (← links)
• A note on homomorphisms of Kneser hypergraphs (Q2284780) ‎ (← links)
• Online coloring a token graph (Q2303438) ‎ (← links)