Havel-Hakimi residues of unigraphs

DOI10.1016/j.ipl.2011.10.011zbMath1232.05057OpenAlexW2003050176MaRDI QIDQ763488

Michael D. Barrus

Publication date: 9 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.011

zbMATH Keywords

combinatorial problemsindependence numbercanonical decompositionresidueHavel-Hakimi algorithmunigraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (1)

On zero-error codes produced by greedy algorithms

Cites Work

• Unnamed Item
• Independence and the Havel-Hakimi residue
• Semi-regular graphs of minimum independence number
• Decomposition of graphical sequences and unigraphs
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On the residue of a graph
• Degree sequences of graphs and dominance order

This page was built for publication: Havel-Hakimi residues of unigraphs