Constructive extensions of two results on graphic sequences
From MaRDI portal
Publication:411867
DOI10.1016/j.dam.2011.06.017zbMath1239.05035OpenAlexW2027682382MaRDI QIDQ411867
Arpit Goel, Ankit Garg, Amitabha Tripathi
Publication date: 30 April 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.017
Related Items (5)
An extension of A.R. Rao's characterization of potentially \(K_{m+1}\)-graphic sequences ⋮ Efficiently Realizing Interval Sequences ⋮ A constructive extension of the characterization on potentially \(K_{s,t}\)-bigraphic pairs ⋮ Bigraphic pairs with a realization containing a split bipartite-graph ⋮ Relaxed and approximate graph realizations
Cites Work
- Unnamed Item
- A theorem on flows in networks
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- Solution to a problem on degree sequences of graphs
- A note on a theorem of Erdős and Gallai
- Combinatorial Properties of Matrices of Zeros and Ones
- Subgraphs with prescribed valencies
This page was built for publication: Constructive extensions of two results on graphic sequences
