Note on polychromatic coloring of hereditary hypergraph families

DOI10.1007/S00373-024-02836-YMaRDI QIDQ6650725

Dömötör Pálvölgyi

Publication date: 9 December 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

hypergraphspolychromatic coloringgraph coloringspanchromatic coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
• Proper coloring of geometric hypergraphs
• On a generalization of Rubin's theorem
• An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
• Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs
• Survey on Decomposition of Multiple Coverings
• Balanced matrices
• Polychromatic colorings of unions of geometric hypergraphs
• Colouring bottomless rectangles and arborescences
• Three-chromatic geometric hypergraphs

This page was built for publication: Note on polychromatic coloring of hereditary hypergraph families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650725)