New sharp lower bound for the quorum coloring number of trees

•The alliance partition number of a tree has a new sharp lower bound computable in linear time.•This new lower bound is better than all those that have been previously established.•There is a relationship between the order, the diameter, the vertices degree and the matching number of a subgraph of a...

Full description

Bibliographic Details

Published in:	Information processing letters Vol. 178; p. 106297
Main Author:	Sahbi, Rafik
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.11.2022
Subjects:	Algorithms Binary trees Defensive alliances Linear-time algorithms Matchings Matchings Algorithms Defensive alliances Linear-time algorithms Binary trees
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!