Covering the edges with consecutive sets

DOI10.1002/jgt.3190150508zbMath0763.05079OpenAlexW2043207029MaRDI QIDQ3984464

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

minimal vertex coverslinearly orderedconsecutive sets

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)

Related Items (5)

Proper interval graphs and the guard problem ⋮ Solving Matching Problems Efficiently in Bipartite Graphs ⋮ Induced matchings in asteroidal triple-free graphs ⋮ On the complexity of the k-chain subgraph cover problem ⋮ Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs

Cites Work

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

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