A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences

DOI10.1016/j.dam.2011.10.015zbMath1241.05143OpenAlexW1973553519MaRDI QIDQ765379

Jian Hua Yin

Publication date: 19 March 2012

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.015

zbMATH Keywords

complete graphgraphic sequenceA.R. Rao's characterization

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items

Largest domination number and smallest independence number of forests with given degree sequence ⋮ An extension of A.R. Rao's characterization of potentially \(K_{m+1}\)-graphic sequences ⋮ On matching numbers of tree and bipartite degree sequences ⋮ Bigraphic pairs with a realization containing a split bipartite-graph

Cites Work

• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• A simple criterion on degree sequences of graphs
• Parallel concepts in graph theory
• Realizability and uniqueness in graphs
• A simple proof of the Erdos-Gallai theorem on graph sequences
• Unnamed Item
• Unnamed Item