Pages that link to "Item:Q3287781"
From MaRDI portal
The following pages link to Graphs with prescribed degrees of vertices. (Q3287781):
Displaying 50 items.
- Some results on the majorization theorem of connected graphs (Q270268) (← links)
- Improving the characterization of P-stability for applications in network privacy (Q277631) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Colour degree matrices of graphs with at most one cycle (Q298973) (← links)
- Graphical sequences of some family of induced subgraphs (Q307914) (← links)
- A note on the characterization of digraphic sequences (Q383344) (← links)
- New results on degree sequences of uniform hypergraphs (Q396927) (← links)
- A Rao-type characterization for a sequence to have a realization containing a split graph (Q409361) (← links)
- A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs (Q409471) (← links)
- Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps (Q411650) (← links)
- Constructive extensions of two results on graphic sequences (Q411867) (← links)
- A semigroup proof of the bounded degree case of S.B. Rao's conjecture on degree sequences and a bipartite analogue (Q414650) (← links)
- Character degree graphs with no complete vertices. (Q441387) (← links)
- New techniques for approximating optimal substructure problems in power-law graphs (Q443723) (← links)
- On realizations of a joint degree matrix (Q479053) (← links)
- Chromatic number and complete graph substructures for degree sequences (Q485549) (← links)
- A complete characterization of graphic sequences with a \(Z_3\)-connected realization (Q499463) (← links)
- A note on packing of graphic \(n\)-tuples (Q501040) (← links)
- An extension of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences (Q507471) (← links)
- Graphic sequences and split graphs (Q519245) (← links)
- General results on preferential attachment and clustering coefficient (Q526411) (← links)
- The signless Laplacian spectral radius of bicyclic graphs with prescribed degree sequences (Q626869) (← links)
- Parameter identifiability in a class of random graph mixture models (Q629100) (← links)
- Random graphs with a given degree sequence (Q640061) (← links)
- Convex polytopes and enumeration (Q675901) (← links)
- Generation of networks with prescribed degree-dependent clustering (Q691437) (← links)
- A degree sequence variant of graph Ramsey numbers (Q742597) (← links)
- Large deviations of empirical neighborhood distribution in sparse random graphs (Q748442) (← links)
- Conditions for sequences to be r-graphic (Q759166) (← links)
- Split digraphs (Q764900) (← links)
- A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences (Q765379) (← links)
- New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
- On degree sequences and eccentricities in pseudoline arrangement graphs (Q831726) (← links)
- On the least size of a graph with a given degree set (Q860412) (← links)
- Nontraceable detour graphs (Q868352) (← links)
- Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences (Q870982) (← links)
- A short proof of a theorem on degree sets of graphs (Q875603) (← links)
- Dually vertex-oblique graphs (Q878622) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- Spiders can be recognized by counting their legs (Q904532) (← links)
- Reconstructing degree sequences from k-vertex-deleted subgraphs (Q908942) (← links)
- The Laplacian spectral radii of trees with degree sequences (Q932582) (← links)
- A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964) (← links)
- Graphic sequences with a realization containing a generalized friendship graph (Q998359) (← links)
- Graphic sequences with a realization containing a complete multipartite subgraph (Q998452) (← links)
- A simple criterion on degree sequences of graphs (Q1003744) (← links)
- A generalization of a conjecture due to Erdös, Jacobson and Lehel (Q1025530) (← links)
- A variation of a conjecture due to Erdös and Sós (Q1034303) (← links)
- Conditions for \(r\)-graphic sequences to be potentially \(K^{(r)}_{m+1}\)-graphic (Q1045022) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
