Covering the edges with consecutive sets

DOI10.1002/JGT.3190150508MaRDI QIDQ3984464zbMATH OpenOpenAlexFDO

Authors Guoli Ding

Publication date 27 June 1992

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190150508

zbMATH Keywords

consecutive setslinearly orderedminimal vertex covers

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Sets defining minimal vertex covers
• scientific article; zbMATH DE number 4110718
• scientific article; zbMATH DE number 822142
• scientific article; zbMATH DE number 861353
• scientific article; zbMATH DE number 48863

Cites work

• A Characterization of Comparability Graphs and of Interval Graphs
• Incidence matrices and interval graphs

Cited in

(9)

• On the complexity of the k-chain subgraph cover problem
• Sets defining minimal vertex covers
• Proper interval graphs and the guard problem
• Induced matchings in asteroidal triple-free graphs
• Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
• Solving matching problems efficiently in bipartite graphs
• scientific article; zbMATH DE number 1792649 (Why is no real title available?)
• Covering Arrays Avoiding Forbidden Edges
• Connected proper interval graphs and the guard problem in spiral polygons (extended abstract)

This page was built for publication: Covering the edges with consecutive sets

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