Publication:5790850
From MaRDI portal
zbMath0033.02602MaRDI QIDQ5790850
Publication date: 1949
Related Items
Graph colourings and partitions, Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle, Local \(k\)-colorings of graphs and hypergraphs, Intersection properties of boxes. I: An upper-bound theorem, Chromatic polynomials for regular graphs and modified wheels, Partitive hypergraphs, Intersection properties of boxes. II: Extremal families, Coefficient relationship between rook and chromatic polynomials, Stirling number identities from chromatic polynomials, A short proof of the existence of highly chromatic hypergraphs without short cycles, Turán's theorem and maximal degrees, The chromaticity of certain graphs with five triangles, Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles, Chromatic equivalence classes of certain generalized polygon trees, Chromatic capacities of graphs and hypergraphs, Bounds on graph eigenvalues. II, Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture, Toughness in graphs -- a survey, Sur le joint d'une famille de graphes