# Independence and the Havel-Hakimi residue

@article{Griggs1994IndependenceAT, title={Independence and the Havel-Hakimi residue}, author={Jerrold R. Griggs and Daniel J. Kleitman}, journal={Discrete Mathematics}, year={1994}, volume={127}, pages={209-212} }

- Published in Discrete Mathematics 1994
DOI:10.1016/0012-365X(92)00479-B

Favaron et al. (1991) have obtained a proof of a conjecture of Fajtlowicz' computer program Graffiti that for every graph G the number of zeroes left after fully reducing the degree sequence as in the Havel-Hakimi Theorem is at most the independence number of G. In this paper we present a simplified version of the proof of Graffiti's conjecture, and we find how the residue relates to a natural greedy algorithm for constructing large independent sets in G.

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 22 CITATIONS

## Graphs with the Strong Havel–Hakimi Property

VIEW 10 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## On the k-residue of disjoint unions of graphs with applications to k-independence

VIEW 6 EXCERPTS

CITES RESULTS & BACKGROUND

HIGHLY INFLUENCED

## k-Independence and the k-residue of a graph

VIEW 4 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Relating the annihilation number and the 2-domination number of block graphs

VIEW 1 EXCERPT

CITES METHODS

## The annihilation number does not bound the 2-domination number from the above.

VIEW 1 EXCERPT

CITES BACKGROUND

## MAX for k-independence in multigraphs

VIEW 1 EXCERPT

CITES BACKGROUND

## Relating the total domination number and the annihilation number of cactus graphs and block graphs

VIEW 1 EXCERPT

CITES RESULTS

## Automated conjecturing III

VIEW 1 EXCERPT

CITES RESULTS

## Automated Conjecturing III Property-relations Conjectures

VIEW 1 EXCERPT

CITES RESULTS

#### References

##### Publications referenced by this paper.

SHOWING 1-6 OF 6 REFERENCES

## Sacle, On the residue of a graph

VIEW 2 EXCERPTS