Sum-list-colouring of -hypergraphs

DOI10.26493/1855-3974.2083.E80MaRDI QIDQ5066973zbMATH OpenOpenAlexFDO

Authors Ewa Drgas-Burchardt, Agata Drzystek, Elżbieta Sidorowicz

Publication date 31 March 2022

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.2083.e80

zbMATH Keywords

\( \theta \)-hypergraphshypergraphssum-list-colouring

Mathematics Subject Classification ID

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

Recommendations

• Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common
• Sum choice number of generalized \(\theta\)-graphs
• Bounds for the sum choice number
• Sum list colorings of small graphs
• Sum list coloring graphs

Cites work

• General and acyclic sum-list-colouring of graphs
• 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?)
• scientific article; zbMATH DE number 1341914 (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 coloring graphs
• Sum list colorings of small graphs

Cited in

(4)

• Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common
• Sum choice number of generalized \(\theta\)-graphs
• Sum-paintability of generalized theta-graphs
• Hypergraph operations preserving sc-greediness

This page was built for publication: Sum-list-colouring of \(\theta \)-hypergraphs

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