Vertex partition of hypergraphs and maximum degenerate subhypergraphs

DOI10.5614/ejgta.2021.9.1.1zbMath1468.05086arXiv1807.02308OpenAlexW3159665602MaRDI QIDQ4958039

Thomas Schweser, Michael Stiebitz

Publication date: 6 September 2021

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

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

zbMATH Keywords

degeneracyvertex partitionhypergraph decompositioncoloring of hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Partitions of hypergraphs under variable degeneracy constraints ⋮ Partitioning into degenerate graphs in linear time

Cites Work

• Brooks' graph-coloring theorem and the independence number
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• An extension of Brooks' theorem to n-degenerate graphs
• The colour theorems of Brooks and Gallai extended
• Vertex arboricity and maximum degree
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• Optimal Vertex Partitions
• Graph decomposition: A new key to coding theorems
• Critical Point-Arboritic Graphs
• Vertex partitions and maximum degenerate subgraphs
• k-Degenerate Graphs
• The Point Partition Numbers of Closed 2-Manifolds
• Partitions of hypergraphs under variable degeneracy constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item