New sharp lower bound for the quorum coloring number of trees

DOI10.1016/j.ipl.2022.106297OpenAlexW4283265343MaRDI QIDQ2169434

Rafik Sahbi

Publication date: 2 September 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106297

zbMATH Keywords

algorithmsmatchingsbinary treeslinear-time algorithmsdefensive alliances

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum matchings and trees
• On some open problems concerning quorum colorings of graphs
• Alliances in graphs: parameters, properties and applications -- a survey
• Quorum colorings of graphs
• The alliance partition number of grid graphs
• On the complexity of some quorum colorings problems of graphs
• Solutions to four open problems on quorum colorings of graphs
• A survey on alliances and related parameters in graphs

This page was built for publication: New sharp lower bound for the quorum coloring number of trees