Adjacency relationships forced by a degree sequence

DOI10.1007/s00373-018-1953-1zbMath1402.05037arXiv1508.00045OpenAlexW2342412623WikidataQ129244304 ScholiaQ129244304MaRDI QIDQ1756108

Michael D. Barrus

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.00045

zbMATH Keywords

degree sequencerealizationdominance orderthreshold graph

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (2)

On fractional realizations of graph degree sequences ⋮ The principal Erdős-Gallai differences of a degree sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hereditary unigraphs and Erdős-Gallai equalities
• Best monotone degree conditions for graph properties: a survey
• The polytope of degree sequences
• The splittance of a graph
• Decomposition of graphical sequences and unigraphs
• The lattice of integer partitions
• Split graphs
• Threshold graphs and related topics
• Neighborhood degree lists of graphs
• Threshold Sequences
• Some Properties of Graphs with Multiple Edges

This page was built for publication: Adjacency relationships forced by a degree sequence