scientific article; zbMATH DE number 786134
From MaRDI portal
Publication:4842710
zbMath0827.05027MaRDI QIDQ4842710
Publication date: 27 November 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (67)
On the upper chromatic number of \((v_3,b_2)\)-configurations ⋮ Colouring 4-cycle systems with equitably coloured blocks ⋮ Triplication for BSTSs and uncolourability ⋮ Mixed hypercacti ⋮ Neighborhood-restricted \([\leq 2\)-achromatic colorings] ⋮ On perfection and imperfection of one-realizations of a given set ⋮ More result on the smallest one-realization of a given set ⋮ Complexity aspects of generalized Helly hypergraphs ⋮ On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques ⋮ The monochromatic block number ⋮ Vertex colorings without rainbow subgraphs ⋮ Unnamed Item ⋮ Mixed interval hypergraphs ⋮ Mixed hypergraphs and other coloring problems ⋮ Unnamed Item ⋮ On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids ⋮ Upper chromatic number of Steiner triple and quadruple systems ⋮ Coloring subgraphs with restricted amounts of hues ⋮ Strict colouring for classes of Steiner triple systems ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Color-bounded hypergraphs. VI: Structural and functional jumps in complexity ⋮ Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs ⋮ Attempting perfect hypergraphs ⋮ Maximum number of colors: C-coloring and related problems ⋮ The chromatic spectrum of 3-uniform bi-hypergraphs ⋮ Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. ⋮ On the upper chromatic number and multiple blocking sets of PG(n,q) ⋮ On the generalized Helly property of hypergraphs, cliques, and bicliques ⋮ On the structure of uniform one-realizations of a given set ⋮ 2-regular equicolourings for \(\mathbf P_4\)-designs ⋮ Colorability of mixed hypergraphs and their chromatic inversions ⋮ Unnamed Item ⋮ The smallest one-realization of a given set. II. ⋮ More results on the smallest one-realization of a given set. II ⋮ Uncolorable mixed hypergraphs ⋮ The Namer-Claimer game ⋮ On the balanced upper chromatic number of finite projective planes ⋮ On a heterochromatic number for hypercubes ⋮ Characterization and recognition of generalized clique-Helly graphs ⋮ On some colouring of 4-cycle systems with specified block colour patterns ⋮ Extended bicolorings of Steiner triple systems of order \(2^{h}-1\) ⋮ The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q) ⋮ On the strong \(p\)-Helly property ⋮ Zero-free intervals of chromatic polynomials of hypergraphs ⋮ Smallest set-transversals of \(k\)-partitions ⋮ Color-bounded hypergraphs, IV: Stable colorings of hypertrees ⋮ A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2 ⋮ Coloring mixed hypertrees ⋮ Circular mixed hypergraphs. II: The upper chromatic number ⋮ C-perfect hypergraphs ⋮ Complete colourings of hypergraphs ⋮ Mixed hypergraphs and beyond ⋮ Mario Gionfriddo and mixed hypergraph coloring ⋮ \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum ⋮ Chromatic polynomials of mixed hypercycles ⋮ Orderings of uniquely colorable hypergraphs ⋮ The smallest one-realization of a given set. IV ⋮ The smallest one-realization of a given set. III ⋮ ℱ-WORM colorings of some 2-trees: partition vectors ⋮ Color-bounded hypergraphs. I: General results ⋮ Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees ⋮ On Voloshin colorings in 3-hypergraph designs ⋮ Strict colourings of STS(\(3v\))s and uncolourable BSTS(\(3v\))s ⋮ Pseudo-chordal mixed hypergraphs ⋮ The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs ⋮ Approximability of the upper chromatic number of hypergraphs ⋮ Mixed colorings of hypergraphs
This page was built for publication:
