Sets defining minimal vertex covers

DOI10.1016/S0012-365X(98)00262-3MaRDI QIDQ1292862zbMATH OpenOpenAlexFDO

Authors Jaume Marti-Ferré

Publication date 30 October 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(98)00262-3

zbMATH Keywords

binary matricesminimal vertex cover sets

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)

Recommendations

• Sets defining minimal vertex covers of uniform hypergraphs.
• scientific article; zbMATH DE number 4110718
• scientific article; zbMATH DE number 822142
• A characterization of graphical covers
• Covering the edges with consecutive sets

Cites work

• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• The Two-Triangle Case of the Acquaintance Graph

Cited in

(11)

• Planar lattice subsets with minimal vertex boundary
• Test sets for vertex cover problems
• Constructing Minimal Coverability Sets
• scientific article; zbMATH DE number 822142 (Why is no real title available?)
• scientific article; zbMATH DE number 4110718 (Why is no real title available?)
• Balanced minimum covers of a finite set
• Sets defining minimal vertex covers of uniform hypergraphs.
• scientific article; zbMATH DE number 2170437 (Why is no real title available?)
• Minimal vertex covers in infinite hypergraphs
• A characterization of graphical covers
• An algebraic approach to sets defining minimal dominating sets of regular graphs

This page was built for publication: Sets defining minimal vertex covers

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