Pages that link to "Item:Q965964"

The following pages link to A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964):

Displaying 18 items.

• A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs (Q409471) (← links)
• Constructive extensions of two results on graphic sequences (Q411867) (← links)
• A constructive extension of the characterization on potentially \(K_{s,t}\)-bigraphic pairs (Q503684) (← links)
• A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences (Q765379) (← links)
• Extremal problems on components and loops in graphs (Q1734913) (← links)
• Precise asymptotics of some meeting times arising from the voter model on large random regular graphs (Q2064842) (← links)
• Relaxed and approximate graph realizations (Q2115836) (← links)
• Vertex-weighted graphs: realizable and unrealizable domains (Q2154111) (← links)
• Independence number of graphs and line graphs of trees by means of omega invariant (Q2174305) (← links)
• Recognition of split-graphic sequences (Q2254547) (← links)
• Vertex-weighted realizations of graphs (Q2286737) (← links)
• A sharp refinement of a result of Zverovich-Zverovich (Q2339424) (← links)
• On vertex-weighted realizations of acyclic and general graphs (Q2672574) (← links)
• On vertex-weighted graph realizations (Q2692719) (← links)
• Exact and approximate results on the least size of a graph with a given degree set (Q2700608) (← links)
• Efficiently Realizing Interval Sequences (Q5138976) (← links)
• Bigraphic pairs with a realization containing a split bipartite-graph (Q5227127) (← links)
• Methods for the graph realization problem (Q6152848) (← links)