On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

Cited in

(only showing first 100 items - show all)

On existence of hypergraphs with prescribed edge degree profile
The polytope of degree sequences
scientific article; zbMATH DE number 2230268 (Why is no real title available?)
Fault-tolerant graph realizations in the congested clique
Signed degree sets in signed graphs
Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence
The set of all values of the domination number in trees with a given degree sequence
New results on degree sequences of uniform hypergraphs
On degree sequences of undirected, directed, and bidirected graphs
On the least size of a graph with a given degree set
Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
On degree sequences and eccentricities in pseudoline arrangement graphs
On the realization of a (p,s)-digraph with prescribed degrees
On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs
On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
Construction of Hamiltonian graphs and bigraphs with prescribed degrees
Multigraphic degree sequences and Hamiltonian-connected line graphs
Hypergraph recovery algorithms from a given vector of vertex degrees
Rao's theorem for forcibly planar sequences revisited
Extremal theorems for degree sequence packing and the two-color discrete tomography problem
Graph extensions, edit number and regular graphs
Some NP-complete problems for hypergraph degree sequences
Enumerating Steiner triple systems
Graphic sequences with a realization containing intersecting cliques
Pairs of sequences with a unique realization by bipartite graphs
Sequences with a unique realization by simple graphs
On the existence of super edge-connected graphs with prescribed degrees
Extremal problems on components and loops in graphs
A parameterized algorithmics framework for degree sequence completion problems in directed graphs
Modulo 5-orientations and degree sequences
Relaxed and approximate graph realizations
Short flip sequences to untangle segments in the plane
Degree sequence and supereulerian graphs
A family of switch equivalent graphs
Game theoretical modelling of a dynamically evolving network. I: General target sequences
Extremal problems for chromatic neighborhood sets
A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
Improving the characterization of P-stability for applications in network privacy
An extremal problem on bigraphic pairs with an \(A\)-connected realization
An intermediate value theorem for the arboricities
The effect of edge and vertex deletion on omega invariant
Forman-Ricci curvature and persistent homology of unweighted complex networks
Graph colourings and partitions
Arranging apples in an array
Realizing degree sequences as \(Z_3\)-connected graphs
On fractional realizations of graph degree sequences
An extremal problem on group connectivity of graphs
I/O-efficient generation of massive graphs following the \textit{LFR} benchmark
Estimation of the covariance structure from SNP allele frequencies
An algorithm for the construction of the graphs of organic molecules
Realizability and uniqueness in graphs
Configuring random graph models with fixed degree sequences
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
On the planarity of regular incidence sequences
On partial sorting in restricted rounds
The mixing time of switch Markov chains: a unified approach
Distance degree regular graphs and distance degree injective graphs: an overview
scientific article; zbMATH DE number 4081605 (Why is no real title available?)
Identifying a set of key members in social networks using SDP-based stochastic search and integer programming algorithms
S̲tochastic S̲imulation A̲lgorithm For Effective Spreading Dynamics On T̲ime-Evolving A̲daptive N̲etworX̲ (SSATAN-X)
Graphic sequences with a realization containing a union of cliques
Graphic sequences with a realization containing a generalized friendship graph
On the discrepancy between two Zagreb indices
A survey of discrete methods in (algebraic) statistics for networks
Colour degree matrices of graphs with at most one cycle
Optimization over degree sequences
Game theoretical modelling of a dynamically evolving network. II: Target sequences of score 1
On null 3-hypergraphs
Degree polynomial for vertices in a graph and its behavior under graph operations
Leaf realization problem, caterpillar graphs and prefix normal words
A short constructive proof of the Erdős-Gallai characterization of graphic lists
Mathematical tools for the future: graph theory and graphicable algebras
A multipartite Hajnal-Szemerédi theorem
A lower bound on the independence number of a graph
Exactly scale-free scale-free networks
A new lower bound on the potential-Ramsey number of two graphs
On matching numbers of tree and bipartite degree sequences
Polytopes, graphs, and complexes
Improvements in performance and security for complex networks
Connectedness criteria for graphs by means of omega invariant
Nontraceable detour graphs
Graphical sequences of some family of induced subgraphs
A short proof of a theorem on degree sets of graphs
Characterization of optimal key set protocols
Linear-time certifying algorithms for near-graphical sequences
Approximating shortest connected graph transformation for trees
Graph realization of sets of integers
Navigating between packings of graphic sequences
Recognition of split-graphic sequences
Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
Graphic deviation
Algebraic characterization of graphical degree stability
Worst-case versus average-case design for estimation from partial pairwise comparisons
Graph realizations constrained by skeleton graphs
The enumeration of graphical partitions
A note on a theorem of Erdős and Gallai
Graph realizations: maximum degree in vertex neighborhoods
On signed degrees in signed graphs
Independence free graphs and vertex connectivity augmentation

This page was built for publication: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3845889)