n-tuple colorings and associated graphs
From MaRDI portal
Publication:1212006
DOI10.1016/0095-8956(76)90010-1zbMath0293.05115OpenAlexW2069232717MaRDI QIDQ1212006
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(76)90010-1
Related Items
Strengthening topological colorful results for graphs, Strong products of Kneser graphs, On the chromatic number of the lexicographic product and the Cartesian sum of graphs, Homology as a Tool in Integer Programming, Connectivity and other invariants of generalized products of graphs, \(k\)-tuple chromatic number of the Cartesian product of graphs, Chromatic invariants for finite graphs: Theme and polynomial variations, The complexity of multicolouring, Induced-path partition on graphs with special blocks, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, Permutation-partition pairs. III: Embedding distributions of linear families of graphs, Star-extremal graphs and the lexicographic product, On fractional Ramsey numbers, Coloring graph products---a survey, Planar graphs without 4- and 6-cycles are (7 : 2)-colorable, Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank, Colorful subhypergraphs in Kneser hypergraphs, On multichromatic numbers of widely colorable graphs, Graph homomorphisms via vector colorings, Unnamed Item, Acyclic coloring of products of digraphs, Graph Information Ratio, Proof of Stahl's conjecture in some new cases, Generalized k-tuple colorings of cycles and other graphs, Exact and Parameterized Algorithms for (k, i)-Coloring, Chromatic optimisation: Limitations, objectives, uses, references, Extending Hall's theorem into list colorings: a partial history, Multicoloring and Mycielski construction, \(T\)-colorings of graphs: recent results and open problems, On the diameter of generalized Kneser graphs, On the tractability of \(( k , i )\)-coloring, On the interval of strong partial clones of Boolean functions containing \(\mathrm{Pol}(\{(0, 0), (0, 1), (1, 0)\})\), Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope, \(k\)-tuple colorings of the Cartesian product of graphs, Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs, Hedetniemi's conjecture for Kneser hypergraphs, On the topological lower bound for the multichromatic number, Grundy number and products of graphs, Multiple \(L(j,1)\)-labeling of the triangular lattice, On the multiple Borsuk numbers of sets, On the ratio of optimal integral and fractional covers, r-tuple colorings of uniquely colorable graphs, Graph theory (algorithmic, algebraic, and metric problems), A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function, Unnamed Item, Independence and coloring properties of direct products of some vertex-transitive graphs, A note on homomorphisms of Kneser hypergraphs, Online coloring a token graph, k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS, Note on Hedetniemi's conjecture and the Poljak-Rödl function, Kneser's conjecture, chromatic number, and homotopy, \(b\)-coloring of Kneser graphs, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, NP-completeness of a family of graph-colouring problems, A note on the Poljak-Rödl function, Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs, Fractional multiples of graphs and the density of vertex-transitive graphs, The chromatic numbers of graph bundles over cycles, Graph products and the chromatic difference sequence of vertex-transitive graphs, The multichromatic numbers of some Kneser graphs, On the fractional chromatic number and the lexicographic product of graphs, Extremal problems concerning Kneser-graphs, On the diameter of Kneser graphs, Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton, On the Multichromatic Number of s‐Stable Kneser Graphs, Colouring lines in projective space
Cites Work
