Generalized hypergraph coloring

DOI10.7151/dmgt.2168zbMath1453.05038arXiv1804.06338OpenAlexW2963639538MaRDI QIDQ2214310

Thomas Schweser

Publication date: 8 December 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.06338

zbMATH Keywords

degeneracyvertex partitionhypergraph decompositioncoloring of hypergraphshypergraph properties

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Point partition numbers: decomposable and indecomposable critical graphs ⋮ Partitions of hypergraphs under variable degeneracy constraints ⋮ Generalized DP-colorings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The colour theorems of Brooks and Gallai extended
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs
• Partitions of multigraphs under minimum degree constraints
• A survey of hereditary properties of graphs
• On generalized list colourings of graphs
• Gallai's innequality for critical graphs of reducible hereditary properties
• Generalized list colourings of graphs
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• Colour Classes for r-Graphs
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• The structure of k-chromatic graphs

This page was built for publication: Generalized hypergraph coloring