Hypergraph operations preserving sc-greediness

DOI10.7151/DMGT.2533MaRDI QIDQ6985888zbMATH OpenFDO

Authors Piotr Borowiecki, Ewa Drgas-Burchardt, Elżbieta Sidorowicz

Publication date 12 May 2025

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

Full work available at URL https://doi.org/10.7151/DMGT.2533

zbMATH Keywords

generalized colouringgreedy algorithmhypergraphlist colouringminimum sumresource allocation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Acyclic sum-list-colouring of grids and other classes of graphs
• Computational aspects of greedy partitioning of graphs
• Dynamic \(F\)-free coloring of graphs
• Dynamic coloring of graphs
• Every planar graph is 5-choosable
• General and acyclic sum-list-colouring of graphs
• Generalized sum List colorings of graphs
• Graph Colorings
• Graph theory
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• Sum choice number of generalized \(\theta\)-graphs
• Sum list coloring 2 n arrays
• Sum list coloring block graphs
• Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common
• Sum-list-colouring of \(\theta \)-hypergraphs

This page was built for publication: Hypergraph operations preserving \(sc\)-greediness

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