Graph realizations: maximum degree in vertex neighborhoods
From MaRDI portal
Publication:6098074
DOI10.1016/J.DISC.2023.113483zbMATH Open1516.05032OpenAlexW3037327598MaRDI QIDQ6098074FDOQ6098074
Authors: Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz 
Publication date: 12 June 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113483
Recommendations
Cites Work
- Title not available (Why is that?)
- A theorem on flows in networks
- Title not available (Why is that?)
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Decomposition of graphical sequences and unigraphs
- Algorithms for constructing graphs and digraphs with given valences and factors
- A remark on the existence of finite graphs
- Combinatorial Properties of Matrices of Zeros and Ones
- Title not available (Why is that?)
- Seven criteria for integer sequences being graphic
- Title not available (Why is that?)
- A congruence theorem for trees
- The splittance of a graph
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- Graph factors
- Subgraphs with prescribed valencies
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- On the realization of a (p,s)-digraph with prescribed degrees
- Zero-one matrices with zero trace
- Graphs and degree sequences. II
- Contributions to the theory of graphic sequences
- Realizability and uniqueness in graphs
- Degree-based graph construction
- Threshold Sequences
- An algorithmic proof of Tutte's f-factor theorem
- Properties of a Class of (0,1)-Matrices Covering a given Matrix
- Sufficient conditions for graphicality of bidegree sequences
- A simple existence criterion for \((g<f)\)-factors
- On Planar Graphical Degree Sequences
- A simple criterion on degree sequences of graphs
- A simple proof of the Erdos-Gallai theorem on graph sequences
- Graphs and degree sequences: Canonical decomposition
- Realizing Degree Sequences in Parallel
- A variant of Niessen's problem on degree sequences of graphs
- On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
- Title not available (Why is that?)
- Fast sequential creation of random realizations of degree sequences
- Realizability of graph specifications: characterizations and algorithms
- Planar bipartite biregular degree sequences
- Efficiently Realizing Interval Sequences
- Neighborhood degree lists of graphs
- Graphs and degree sequences. I
- On forcibly hereditary P-graphical sequences
- Graphic sequences of trees and a problem of Frobenius
- Graphs and degree sequences: A survey. III
- Ulam's Conjecture and Graph Reconstructions
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
- Title not available (Why is that?)
- Neighborhood degree lists of graphs
- Vertex-weighted realizations of graphs
- Nearest neighbour graph realizability is NP-hard
- Composed degree-distance realizations of graphs
- Connected realizations of joint-degree matrices
- 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)
