Partitions of hypergraphs under variable degeneracy constraints

DOI10.1002/jgt.22575zbMath1530.05139arXiv1804.04894OpenAlexW3022715693MaRDI QIDQ6055378

Thomas Schweser, Michael Stiebitz

Publication date: 29 September 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

degeneracyvertex partitionhypergraph coloringhypergraph decomposition

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) Vertex degrees (05C07)

Related Items

Point partition numbers: decomposable and indecomposable critical graphs ⋮ Generalized DP-colorings of graphs ⋮ Defective coloring of hypergraphs ⋮ Vertex partition of hypergraphs and maximum degenerate subhypergraphs

Cites Work

• An extension of Brooks' theorem to n-degenerate graphs
• The colour theorems of Brooks and Gallai extended
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• Partitioning a graph into degenerate subgraphs
• Generalized hypergraph coloring
• Partition the vertices of a graph into one independent set and one acyclic set
• Optimal Vertex Partitions
• Critical Point-Arboritic Graphs
• Vertex partition of hypergraphs and maximum degenerate subhypergraphs
• Über eine von H. S. WILF angegebene Schranke für die chromatische Zahl endlicher Graphen
• k-Degenerate Graphs
• The Point Partition Numbers of Closed 2-Manifolds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item