scientific article
From MaRDI portal
Publication:3287781
zbMath0103.39701MaRDI QIDQ3287781
Publication date: 1961
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
On degree sequences of undirected, directed, and bidirected graphs ⋮ Threshold Sequences ⋮ Graph realizations constrained by skeleton graphs ⋮ The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence ⋮ Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ Solution to a forcible version of a graphic sequence problem ⋮ Plane Graphs with Parity Constraints ⋮ Minimum \(H\)-decompositions of graphs ⋮ On an extremal inverse problem in graph theory ⋮ Vertex-weighted graphs: realizable and unrealizable domains ⋮ Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking ⋮ Minimum degree conditions for the strength and bandwidth of graphs ⋮ A further result on the potential-Ramsey number of G1 and G2 ⋮ A note on the potential function of an arbitrary graph H ⋮ Large deviation for uniform graphs with given degrees ⋮ Making multigraphs simple by a sequence of double edge swaps ⋮ The potential-Ramsey number of $K_n$ and $K_t^{-k}$ ⋮ On degree sequence optimization ⋮ Optimization over degree sequences of graphs ⋮ Containment: a variation of cops and robber ⋮ Packing tree degree sequences ⋮ Extremal values of the chromatic number for a given degree sequence ⋮ Optimization over Degree Sequences ⋮ Neighborhood degree lists of graphs ⋮ A characterization of box-bounded degree sequences of graphs ⋮ On vertex-weighted realizations of acyclic and general graphs ⋮ New results on imbalance graphic graphs ⋮ Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ Building large \(k\)-cores from sparse graphs ⋮ On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two ⋮ Vertex degrees close to the average degree ⋮ AROUND THE ERDÖS–GALLAI CRITERION ⋮ A model of the formation of multilayer networks ⋮ The \(A_{\alpha}\)-spectral radius of bicyclic graphs with given degree sequences ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ On the number of edges in a graph with many two-hop disjoint paths ⋮ Characterization and reconstruction of hypergraphic pattern sequences ⋮ Fault-tolerant graph realizations in the congested clique ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Structure and complexity of 2-intersection graphs of 3-hypergraphs ⋮ The smallest degree sum that yields potentially \(K_{r+1}-K_3\)-graphic sequences ⋮ On vertex-weighted graph realizations ⋮ Constructing bounded degree graphs with prescribed degree and neighbor degree sequences ⋮ Exact and approximate results on the least size of a graph with a given degree set ⋮ Plane graphs with parity constraints ⋮ Unnamed Item ⋮ Edge disjoint caterpillar realizations ⋮ On the status sequences of trees ⋮ On the existence of super edge-connected graphs with prescribed degrees ⋮ Efficiently Realizing Interval Sequences ⋮ On line sum optimization ⋮ Configuring Random Graph Models with Fixed Degree Sequences ⋮ Chromatic index, treewidth and maximum degree ⋮ On the hardness of optimization in power-law graphs ⋮ Irregularity strength of dense graphs ⋮ Realization of a sum of sequences by a sum graph ⋮ Distance degree regular graphs and distance degree injective graphs: an overview ⋮ Spanning subgraphs with specified valencies. (Reprint) ⋮ Unnamed Item ⋮ A new lower bound on the potential-Ramsey number of two graphs ⋮ Stability of the Potential Function ⋮ Uniform and monotone line sum optimization ⋮ The condition for a sequence to be potentially $A_{L, M}$- graphic ⋮ Steiner diameter, maximum degree and size of a graph ⋮ Degree-anonymization using edge rotations ⋮ Vertex-weighted realizations of graphs ⋮ On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\) ⋮ Potentially K m — G-graphical sequences: A survey ⋮ Graphic sequences of trees and a problem of Frobenius ⋮ A note on degree-continuous graphs ⋮ NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs ⋮ On the Complexity of Reconstructing H-free Graphs from Their Star Systems ⋮ The majorization theorems of single-cone trees and single-cone unicyclic graphs ⋮ Signed and Minus Dominating Functions in Graphs ⋮ On maximal graphical partitions that are the nearest to a given graphical partition ⋮ Properties of unique degree sequences of 3-uniform hypergraphs ⋮ On the reconstruction of 3-uniform hypergraphs from step-two degree sequences ⋮ Bigraphic pairs with a realization containing a split bipartite-graph ⋮ Graphs with prescribed local neighborhoods of their universal coverings ⋮ On a problem of potentially pancyclic-graphic sequences due to S.B. Rao ⋮ Degree Sequence of Tight Distance Graphs ⋮ Extreme degree sequences of simple graphs ⋮ Directed random graphs with given degree distributions ⋮ Sampling \(k\)-partite graphs with a given degree sequence ⋮ Typicality and entropy of processes on infinite trees ⋮ Degree Sequences in Complexes and Hypergraphs ⋮ Maximum size of a graph with given fractional matching number ⋮ An extremal problem on graphic sequences with a realization containing every \(\ell \)-tree on \(k\) vertices ⋮ Global Clustering Coefficient in Scale-Free Weighted and Unweighted Networks ⋮ A remark concerning graphical sequences ⋮ Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size ⋮ On the \(\sigma_t\)-irregularity and the inverse irregularity problem ⋮ A generalization of a theorem of Nash-Williams ⋮ Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays ⋮ The Burge correspondence and crystal graphs ⋮ Note on a zero net-regular signed graph ⋮ Relaxed and approximate graph realizations ⋮ A study on the existence of null labelling for 3-hypergraphs ⋮ A triangle process on regular graphs ⋮ Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture
This page was built for publication:
