Graph realizations: maximum degree in vertex neighborhoods
From MaRDI portal
(Redirected from Publication:6098074)
Recommendations
Cites work
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 3743297 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- scientific article; zbMATH DE number 7651149 (Why is no real title available?)
- A congruence theorem for trees
- A remark on the existence of finite graphs
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- A simple criterion on degree sequences of graphs
- A simple existence criterion for \((g<f)\)-factors
- A simple proof of the Erdos-Gallai theorem on graph sequences
- A theorem on flows in networks
- A variant of Niessen's problem on degree sequences of graphs
- Algorithms for constructing graphs and digraphs with given valences and factors
- An algorithmic proof of Tutte's f-factor theorem
- Combinatorial Properties of Matrices of Zeros and Ones
- Contributions to the theory of graphic sequences
- Decomposition of graphical sequences and unigraphs
- Degree-based graph construction
- Efficiently Realizing Interval Sequences
- Fast sequential creation of random realizations of degree sequences
- Graph factors
- Graphic sequences of trees and a problem of Frobenius
- Graphs and degree sequences. I
- Graphs and degree sequences. II
- Graphs and degree sequences: A survey. III
- Graphs and degree sequences: Canonical decomposition
- Neighborhood degree lists of graphs
- On Planar Graphical Degree Sequences
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On forcibly hereditary P-graphical sequences
- On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
- On the realization of a (p,s)-digraph with prescribed degrees
- Planar bipartite biregular degree sequences
- Properties of a Class of (0,1)-Matrices Covering a given Matrix
- Realizability and uniqueness in graphs
- Realizability of graph specifications: characterizations and algorithms
- Realizing Degree Sequences in Parallel
- Seven criteria for integer sequences being graphic
- Subgraphs with prescribed valencies
- Sufficient conditions for graphicality of bidegree sequences
- The splittance of a graph
- Threshold Sequences
- Ulam's Conjecture and Graph Reconstructions
- Zero-one matrices with zero trace
Cited in
(10)- Graph profile realizations and applications to social networks
- The maximal degree in a Poisson-Delaunay graph
- Realizability of graph specifications: characterizations and algorithms
- scientific article; zbMATH DE number 7759278 (Why is no real title available?)
- Neighborhood degree lists of graphs
- Vertex-weighted realizations of graphs
- Nearest neighbour graph realizability is NP-hard
- Connected realizations of joint-degree matrices
- Composed degree-distance realizations of graphs
- Cliques in realization graphs
This page was built for publication: Graph realizations: maximum degree in vertex neighborhoods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098074)
