Reference health
Vertex packings: Structural properties and algorithms
10/10 checkable references clean · checked 2026-09-03
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
8 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 10 checked references that resolve
resolves10.1137/0201013
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
resolves10.1287/opre.19.4.998
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
The 8 references without a DOI — listed, not checked
no DOI — not checkedE. Balas and H. Samuelsson, “Finding a minimum node cover in an arbitrary graph”, Management Sciences Research Rept. No. 325, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pa. (November 1973).
no DOI — not checkedM.L. Balinski, “On maximum matching, minimum covering and their connections”, in: H.W. Kuhn, ed.,Proceedings of the Princeton symposium on mathematical programming, (Princeton University Press, Princeton, N.J., 1970) pp. 303–312.
no DOI — not checkedC. Berge,The theory of graphs and its applications (Methuen, London, 1962).
no DOI — not checkedV. Chvátal, “On certain polytopes associated with graphs”, Centre de Recherches Mathématiques-238, Université de Montréal (October 1972).
no DOI — not checkedL.R. Ford, Jr. and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, N.J., 1962).
no DOI — not checkedR. Tarjan, “Finding a maximum clique”, Tech. Rept. 72-123, Dept. of Computer Science, Cornell University, Ithaca, N.Y. (March 1972).
no DOI — not checkedL.E. Trotter, Jr., “Solution characteristics and algorithms for the vertex packing problem”, Tech. Rept. No. 168, Dept. of Operations Research, Cornell University, Ithaca, N.Y. (January 1973).
no DOI — not checkedL.E. Trotter, Jr., “A class of facet producing graphs for vertex packing polyhedra”, Research Rept. No. 78, Dept. of Administrative Sciences, Yale University, New Haven, Conn. (February 1974).
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-09-03 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1007/bf01580444"><img src="https://citestamp.com/citestamped/10.1007/bf01580444/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.1007/bf01580444)