A note on a theorem of Erdős and Gallai

DOI10.1016/S0012-365X(02)00886-5zbMath1020.05022WikidataQ60326856 ScholiaQ60326856MaRDI QIDQ1874382

Amitabha Tripathi, Sujith Vijay

Publication date: 25 May 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

degree sequence; graphical sequence

Mathematics Subject Classification ID

05C07: Vertex degrees

Related Items

Coordination in Dynamic Social Networks Under Heterogeneity, Hidden Population Size Estimation From Respondent-Driven Sampling: A Network Approach, Unnamed Item, Efficiently Realizing Interval Sequences, NONREGULAR GRAPHS WITH MINIMAL TOTAL IRREGULARITY, Improving the characterization of P-stability for applications in network privacy, A note on the characterization of digraphic sequences, Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps, Constructive extensions of two results on graphic sequences, On the least size of a graph with a given degree set, A simple criterion on degree sequences of graphs, Complete subgraphs of the coprime hypergraph of integers. I: Introduction and bounds, Graph extensions, edit number and regular graphs, Independence number of graphs and line graphs of trees by means of omega invariant, Packing tree degree sequences, Vertex-weighted realizations of graphs, Graphs with prescribed local neighborhoods of their universal coverings, A sharp refinement of a result of Zverovich-Zverovich, Minimum \(H\)-decompositions of graphs, A remark concerning graphical sequences

Cites Work

• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Unnamed Item
• Unnamed Item