Coverings by minimal transversals

DOI10.1016/0012-365X(78)90008-0zbMath0394.05023OpenAlexW2016548873MaRDI QIDQ1252245

K. Appert

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0012-365x(78)90008-0

zbMATH Keywords

Covering By Minimal TransversalsDominating SetMaximal Independent SetsRegular Simple Graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)

Related Items (6)

On graphs admitting two disjoint maximum independent sets ⋮ Independent domination, colorings and the fractional idomatic number of a graph ⋮ Disjoint cliques and disjoint maximal independent sets of vertices in graphs ⋮ A structural approach for independent domination of regular graphs ⋮ A counterexample to montgomery's conjecture on dynamic colourings of regular graphs ⋮ 1-well-covered graphs revisited

Cites Work

• Disjoint independent dominating sets in graphs
• Matchings in polytopal graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coverings by minimal transversals