Pages that link to "Item:Q2851492"
From MaRDI portal
The following pages link to On the reconstruction of graph invariants (Q2851492):
Displaying 16 items.
- Reconstruction of interval graphs (Q604467) (← links)
- A computational approach to construct a multivariate complete graph invariant (Q903598) (← links)
- On \({\mathcal C}K_ 1\)-reconstruction of a pair of graphs (Q909679) (← links)
- INGRID: A graph invariant manipulator (Q1113914) (← links)
- Reconstruction of infinite locally finite connected graphs (Q1406548) (← links)
- Reconstruction of Boolean formulas in conjunctive normal form (Q1791022) (← links)
- Finite-type invariants for graphs and graph reconstructions (Q1881101) (← links)
- Reconstructing subgraph-counting graph polynomials of increasing families of graphs (Q2566153) (← links)
- Kocay's lemma, Whitney's theorem, and some polynomial invariant reconstruction problems (Q2583663) (← links)
- On the reconstruction of planar graphs (Q2642012) (← links)
- On the reconstruction of graph invariants (Q2851492) (← links)
- Proving properties of the edge elimination polynomial using equivalent graph polynomials (Q2869336) (← links)
- On Reconstructing Graphs and Their Complements (Q2935256) (← links)
- (Q3483310) (← links)
- Reconstructing the number of copies of a valency‐labeled finite graph in an infinite graph (Q4284097) (← links)
- (Q4316714) (← links)