Pages that link to "Item:Q3845889"

The following pages link to On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I (Q3845889):

Displaying 50 items.

• Graphic sequences with a realization containing intersecting cliques (Q270273) (← links)
• Improving the characterization of P-stability for applications in network privacy (Q277631) (← links)
• An extremal problem on bigraphic pairs with an \(A\)-connected realization (Q284713) (← links)
• Colour degree matrices of graphs with at most one cycle (Q298973) (← links)
• Graphical sequences of some family of induced subgraphs (Q307914) (← links)
• A topological insight into restricted Boltzmann machines (Q331673) (← links)
• Graphs with the strong Havel-Hakimi property (Q343704) (← links)
• Mathematical tools for the future: graph theory and graphicable algebras (Q371568) (← links)
• A note on the characterization of digraphic sequences (Q383344) (← links)
• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
• New results on degree sequences of uniform hypergraphs (Q396927) (← links)
• Realizing degree sequences as \(Z_3\)-connected graphs (Q400414) (← links)
• On fractional realizations of graph degree sequences (Q405210) (← links)
• Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps (Q411650) (← links)
• An extremal problem on group connectivity of graphs (Q427794) (← links)
• Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees (Q452949) (← links)
• On realizations of a joint degree matrix (Q479053) (← links)
• An equation-free approach to coarse-graining the dynamics of networks (Q482712) (← links)
• On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic (Q524192) (← links)
• An intermediate value theorem for the arboricities (Q554848) (← links)
• The polytope of degree sequences (Q584289) (← links)
• Degree sequences and graphs with disjoint spanning trees (Q642969) (← links)
• Generation of networks with prescribed degree-dependent clustering (Q691437) (← links)
• A family of switch equivalent graphs (Q704278) (← links)
• On the discrepancy between two Zagreb indices (Q724879) (← links)
• A degree sequence variant of graph Ramsey numbers (Q742597) (← links)
• Conditions for sequences to be r-graphic (Q759166) (← links)
• Havel-Hakimi residues of unigraphs (Q763488) (← 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)
• A short proof of a theorem on degree sets of graphs (Q875603) (← links)
• The complexity of degree anonymization by vertex addition (Q897957) (← links)
• Spiders can be recognized by counting their legs (Q904532) (← links)
• Multigraph realizations of degree sequences: Maximization is easy, minimization is hard (Q957360) (← links)
• A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964) (← links)
• Graphic sequences with a realization containing a union of cliques (Q995771) (← links)
• Graphic sequences with a realization containing a generalized friendship graph (Q998359) (← links)
• Degree sequence and supereulerian graphs (Q998406) (← links)
• A simple criterion on degree sequences of graphs (Q1003744) (← links)
• The edge version of Hadwiger's conjecture (Q1011784) (← links)
• A remark on degree sequences of multigraphs (Q1014317) (← links)
• Enumeration of the degree sequences of non-separable graphs and connected graphs (Q1024330) (← links)
• Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
• The convex hull of degree sequences of signed graphs (Q1045125) (← links)
• Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences (Q1050376) (← links)
• Some NP-complete problems for hypergraph degree sequences (Q1076694) (← links)
• Arranging apples in an array (Q1115447) (← links)
• The enumeration of graphical partitions (Q1150368) (← links)
• Degree realization of undirected graphs in reduced form (Q1211059) (← links)