A characterization of graphical covers

DOI10.1016/0012-365X(85)90164-5MaRDI QIDQ1082354zbMATH OpenOpenAlexFDO

Authors A. R. Bednarek, R. E. Osteen

Publication date 1985

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(85)90164-5

zbMATH Keywords

graphgraphical covers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Review text

In a short paper the two authors consider a family \({\mathcal S}\) of sets, define a graph G(\({\mathcal S})\) in the following natural way: The set of vertices of G(\({\mathcal S})\) is \(X=\cup {\mathcal S}\) and the set of edges consists of all unordered pairs of distinct vertices for which there exists a member of \({\mathcal S}\) to which both belong. Then they introduce the concept 'The family of \({\mathcal S}\) is graphical' or '\({\mathcal S}\) is a graphical cover of X' and finally they give some characterizations of graphical covers.

Recommendations

• Sets defining minimal vertex covers
• scientific article; zbMATH DE number 2170437
• scientific article; zbMATH DE number 3478888
• Graphoidal covers and graphoidal covering number of a graph
• Sets defining minimal vertex covers of uniform hypergraphs.

Cites work

• A remark on systems of maximal cliques of a graph
• scientific article; zbMATH DE number 3652325 (Why is no real title available?)
• scientific article; zbMATH DE number 3264930 (Why is no real title available?)

Cited in

(7)

• Sets defining minimal vertex covers
• scientific article; zbMATH DE number 3861197 (Why is no real title available?)
• scientific article; zbMATH DE number 3865329 (Why is no real title available?)
• scientific article; zbMATH DE number 2068161 (Why is no real title available?)
• scientific article; zbMATH DE number 2170437 (Why is no real title available?)
• Characterization of \(Z_m\)-well-covered graphs for some classes of graphs
• A characterization of König-Egerváry graphs with extendable vertex covers

This page was built for publication: A characterization of graphical covers

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