On total covers of graphs

DOI10.1016/0012-365X(92)90643-TzbMath0773.05080MaRDI QIDQ1198645

Yousef Alavi, Jiuqiang Liu, Jian-fang Wang, Zhong Fu Zhang

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

total covering numbertotal cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (9)

Mixed domination and 2-independence in trees ⋮ Mixed Roman domination in graphs ⋮ On the complexity of variations of mixed domination on graphs^† ⋮ Unnamed Item ⋮ The algorithmic complexity of mixed domination in graphs ⋮ On the relations of graph parameters and its total parameters ⋮ Upper and lower bounds on approximating weighted mixed domination ⋮ On the relations between arboricity and independent number or covering number ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs

Cites Work

• Matching theory
• Total matchings and total coverings of graphs
• Unnamed Item

This page was built for publication: On total covers of graphs