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)

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

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

Cited in

(6)

• scientific article; zbMATH DE number 2068161 (Why is no real title available?)
• scientific article; zbMATH DE number 3865329 (Why is no real title available?)
• Characterization of \(Z_m\)-well-covered graphs for some classes of graphs
• scientific article; zbMATH DE number 2170437 (Why is no real title available?)
• scientific article; zbMATH DE number 3861197 (Why is no real title available?)
• 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)