A note on a theorem of Erdős and Gallai

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

Amitabha Tripathi, Sujith Vijay

Publication date: 25 May 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00886-5

zbMATH Keywords

degree sequencegraphical sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (32)

Improving the characterization of P-stability for applications in network privacy ⋮ Unnamed Item ⋮ Minimum \(H\)-decompositions of graphs ⋮ Vertex-weighted graphs: realizable and unrealizable domains ⋮ On the least size of a graph with a given degree set ⋮ Independence number of graphs and line graphs of trees by means of omega invariant ⋮ Packing tree degree sequences ⋮ Complete subgraphs of the coprime hypergraph of integers. I: Introduction and bounds ⋮ A note on the characterization of digraphic sequences ⋮ On vertex-weighted realizations of acyclic and general graphs ⋮ Building large \(k\)-cores from sparse graphs ⋮ Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps ⋮ Constructive extensions of two results on graphic sequences ⋮ On triangular biregular degree sequences ⋮ Degree realization by bipartite multigraphs ⋮ On vertex-weighted graph realizations ⋮ Exact and approximate results on the least size of a graph with a given degree set ⋮ Efficiently Realizing Interval Sequences ⋮ Graph extensions, edit number and regular graphs ⋮ Coordination in Dynamic Social Networks Under Heterogeneity ⋮ Unnamed Item ⋮ Vertex-weighted realizations of graphs ⋮ A simple criterion on degree sequences of graphs ⋮ Hidden Population Size Estimation From Respondent-Driven Sampling: A Network Approach ⋮ Graphs with prescribed local neighborhoods of their universal coverings ⋮ The principal Erdős-Gallai differences of a degree sequence ⋮ NONREGULAR GRAPHS WITH MINIMAL TOTAL IRREGULARITY ⋮ Fast Sequential Creation of Random Realizations of Degree Sequences ⋮ A sharp refinement of a result of Zverovich-Zverovich ⋮ A remark concerning graphical sequences ⋮ On the \(\sigma_t\)-irregularity and the inverse irregularity problem ⋮ Relaxed and approximate graph realizations

Cites Work

• Unnamed Item
• 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

This page was built for publication: A note on a theorem of Erdős and Gallai