Pages that link to "Item:Q1003744"
From MaRDI portal
The following pages link to A simple criterion on degree sequences of graphs (Q1003744):
Displaying 19 items.
- A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences (Q765379) (← links)
- A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- A triangle process on regular graphs (Q2115867) (← 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)
- Packing tree degree sequences (Q2175807) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Vertex-weighted realizations of graphs (Q2286737) (← links)
- On vertex-weighted realizations of acyclic and general graphs (Q2672574) (← links)
- Degree sequence of graph operator for some standard graphs (Q2690755) (← links)
- On vertex-weighted graph realizations (Q2692719) (← links)
- (Q4583393) (← links)
- (Q4627889) (← links)
- (Q5197729) (← links)
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition (Q5237060) (← links)
- (Q5874474) (← links)
- Graph realizations: maximum degree in vertex neighborhoods (Q6098074) (← links)
- Methods for the graph realization problem (Q6152848) (← links)
