Realizability and uniqueness in graphs
From MaRDI portal
Publication:1344609
Recommendations
- Realizability of graphs
- Conditions for Unique Graph Realizations
- Constructing uniquely realizable graphs
- Realizability of graphs and linkages
- Realizability problem for commuting graphs
- scientific article; zbMATH DE number 2061805
- On (1, 2)-realizable graphs
- On uniqueness of a general factorization of graph properties
- The matching uniqueness of a graphs
- On uniquely intersectable graphs
Cites work
- A Group Testing Problem on Two Disjoint Sets
- A remark on the existence of finite graphs
- A search problem on graphs which generalizes some group testing problems with two defectives
- A theorem on flows in networks
- A tight upper bound for group testing in graphs
- Combinatorial Properties of Matrices of Zeros and Ones
- Degree sequences of graphs and dominance order
- Edge search in graphs and hypergraphs of bounded rank
- Graph isomorphism is low for PP
- Group testing with two defectives
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 3859133 (Why is no real title available?)
- scientific article; zbMATH DE number 3720966 (Why is no real title available?)
- scientific article; zbMATH DE number 3758373 (Why is no real title available?)
- scientific article; zbMATH DE number 17789 (Why is no real title available?)
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- scientific article; zbMATH DE number 3489167 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1346509 (Why is no real title available?)
- scientific article; zbMATH DE number 867707 (Why is no real title available?)
- Multiplicities and Minimal Widths for (0, 1)-Matrices
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On the residue of a graph
- Reconstructing a Graph from its Neighborhood Lists
- Search problems on graphs
- Some NP-Complete Problems Similar to Graph Isomorphism
- The polytope of degree sequences
- Threshold Sequences
- Zero-one matrices with zero trace
Cited in
(45)- A parallel algorithm for nearly optimal edge search
- Graph-theoretical conditions for inscribability and Delaunay realizability
- Edge search in hypergraphs
- Realizability of graph specifications: characterizations and algorithms
- Uniqueness of minimal graph in general codimension
- Extremal problems on components and loops in graphs
- Realizability and verification of MSC graphs
- On (1, 2)-realizable graphs
- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays
- Relaxed and approximate graph realizations
- Vertex-weighted graphs: realizable and unrealizable domains
- Independence number of graphs and line graphs of trees by means of omega invariant
- Graph exponentiation and neighborhood reconstruction
- On vertex-weighted realizations of acyclic and general graphs
- On vertex-weighted graph realizations
- Some Ulam's reconstruction problems for quantum states
- On the complexity of reconstructing H-free graphs from their Star Systems
- Property testing for bounded degree databases
- New results on degree sequences of uniform hypergraphs
- Conditions for Unique Graph Realizations
- Reconstructing a Graph from its Neighborhood Lists
- Toughness and vertex degrees
- scientific article; zbMATH DE number 1439420 (Why is no real title available?)
- The effect of edge and vertex deletion on omega invariant
- Upward-closed hereditary families in the dominance order
- Majorization and the number of bipartite graphs for given vertex degrees
- Efficiently realizing interval sequences
- Omega invariant of graphs and cyclicness
- scientific article; zbMATH DE number 7085090 (Why is no real title available?)
- Neighborhood reconstruction and cancellation of graphs
- On the Complexity of Reconstructing H-free Graphs from Their Star Systems
- scientific article; zbMATH DE number 970793 (Why is no real title available?)
- Fast sequential creation of random realizations of degree sequences
- scientific article; zbMATH DE number 7651149 (Why is no real title available?)
- Realization problems on reachability sequences
- Graph realizations: maximum degree in vertex neighborhoods
- Degree polynomial for vertices in a graph and its behavior under graph operations
- Realizing graphs with cut constraints
- Degree realization by bipartite cactus graphs
- Dense, irregular, yet always-graphic 3-uniform hypergraph degree sequences
- Degree realization with minimum dominating set
- A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences
- New sufficient conditions on the degree sequences of uniform hypergraphs
- Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
This page was built for publication: Realizability and uniqueness in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344609)
