scientific article; zbMATH DE number 3188524
From MaRDI portal
Publication:5724800
zbMath0116.01104MaRDI QIDQ5724800
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs, Probabilistic methods, From Erdős to algorithms, Edge (m,k)-choosability of graphs, Unsplittable coverings in the plane, Equitable colorings of nonuniform hypergraphs, On the chromatic number and independence number of hypergraph products, On packing time-respecting arborescences, A note on two-colorability of nonuniform hypergraphs, On some generalizations of the property B problem of an \(n\)-uniform hypergraph, On proper colorings of hypergraphs, On 3-chromatic hypergraphs, The intersection spectrum of 3‐chromatic intersecting hypergraphs, DP-colorings of hypergraphs, 2-colorings of hypergraphs with large girth, Extremal problems in hypergraph colourings, On the minimum size of 4-uniform hypergraphs without property \(B\), On colorings of 3-homogeneous hypergraphs in 3 colors, Arithmetic Progressions and Tic-Tac-Toe Games, On property B(s). II, Colorings of hypergraphs with large number of colors, On \(r\)-chromatic hypergraphs, On the construction of non-2-colorable uniform hypergraphs, Random hypergraphs and property B, Blocking sets of the classical unital, Coupon coloring of cographs, 2-colorings of uniform hypergraphs, Coupon coloring of some special graphs, Inclusion/exclusion meets measure and conquer, Coupon-coloring and total domination in Hamiltonian planar triangulations, Improved Bounds for Uniform Hypergraphs without Property B, Bipartite bihypergraphs: a survey and new results, On property B and on Steiner systems, An extremal problem in hypergraph coloring, Chip games and paintability, Coloring non-uniform hypergraphs without short cycles, List colorings of multipartite hypergraphs, Computational experience with approximation algorithms for the set covering problem, Counting Hypergraph Colorings in the Local Lemma Regime, The \(B_r\) property and chromatic numbers of generalized graphs, On the Problem of Erdős and Hajnal in the Case of List Colorings, New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\), Sparse colour-critical hypergraphs, On coupon colorings of graphs
