Pages that link to "Item:Q1344609"
From MaRDI portal
The following pages link to Realizability and uniqueness in graphs (Q1344609):
Displaying 38 items.
- New results on degree sequences of uniform hypergraphs (Q396927) (← links)
- Neighborhood reconstruction and cancellation of graphs (Q528982) (← links)
- A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences (Q765379) (← links)
- New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
- Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs (Q868330) (← links)
- A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964) (← links)
- A parallel algorithm for nearly optimal edge search (Q1350305) (← links)
- Graph-theoretical conditions for inscribability and Delaunay realizability (Q1356410) (← links)
- Edge search in hypergraphs (Q1356674) (← links)
- Realizability of graph specifications: characterizations and algorithms (Q1713877) (← links)
- Uniqueness of minimal graph in general codimension (Q1725854) (← links)
- Extremal problems on components and loops in graphs (Q1734913) (← links)
- Realizability and verification of MSC graphs (Q1770427) (← links)
- On (1, 2)-realizable graphs (Q1815308) (← links)
- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays (Q2106608) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Vertex-weighted graphs: realizable and unrealizable domains (Q2154111) (← links)
- Independence number of graphs and line graphs of trees by means of omega invariant (Q2174305) (← links)
- Graph exponentiation and neighborhood reconstruction (Q2214326) (← links)
- On vertex-weighted realizations of acyclic and general graphs (Q2672574) (← links)
- On vertex-weighted graph realizations (Q2692719) (← links)
- Some Ulam’s reconstruction problems for quantum states (Q3120034) (← links)
- On the complexity of reconstructing H-free graphs from their Star Systems (Q3174240) (← links)
- Property Testing for Bounded Degree Databases (Q3304100) (← links)
- Conditions for Unique Graph Realizations (Q3990103) (← links)
- Toughness and Vertex Degrees (Q4908831) (← links)
- (Q4949794) (← links)
- The effect of edge and vertex deletion on omega invariant (Q4989001) (← links)
- Upward-closed hereditary families in the dominance order (Q5024680) (← links)
- Majorization and the number of bipartite graphs for given vertex degrees (Q5135453) (← links)
- Efficiently Realizing Interval Sequences (Q5138976) (← links)
- (Q5197729) (← links)
- (Q5224846) (← links)
- On the Complexity of Reconstructing H-free Graphs from Their Star Systems (Q5458528) (← links)
- Fast Sequential Creation of Random Realizations of Degree Sequences (Q5856436) (← links)
- (Q5874474) (← links)
- Realization problems on reachability sequences (Q5925515) (← links)
- Graph realizations: maximum degree in vertex neighborhoods (Q6098074) (← links)
