Graphs with the strong Havel-Hakimi property
type: Item
instance of: scholarly article
title: Graphs with the strong Havel-Hakimi property
zbMATH Open document ID: 1351.05166
author: Michael D. Barrus
author: Grant Molnar
published in: Graphs and Combinatorics
publication date: 2016-11-29T00:00:00Z
full work available at URL: https://arxiv.org/abs/1505.00085
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 6657137
zbMATH Keywords: independence number
zbMATH Keywords: Havel-Hakimi algorithm
zbMATH Keywords: residue
describes a project that uses: GRAFFITI
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2106681755
cites work: On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence
cites work: Graphs \& digraphs
cites work: Q3197866
cites work: On the residue of a graph
cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
cites work: Independence and the Havel-Hakimi residue
cites work: A remark on the existence of finite graphs
cites work: k-Independence and thek-residue of a graph
cites work: Threshold graphs and related topics
cites work: Degree sequences of graphs and dominance order
DOI: 10.1007/S00373-015-1674-7
Recommended article: Independence and the Havel-Hakimi residue
Recommended article: k-Independence and thek-residue of a graph
Recommended article: Havel-Hakimi residues of unigraphs
Recommended article: On the residue of a graph
Recommended article: A simple criterion on degree sequences of graphs
description: scientific article; zbMATH DE number 6657137