Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices von Kostochka, Alexandr V., Nahvi, Mina, West, Douglas B., Zirlin, Dara

Volltext

Cut-Edges and Regular Factors in Regular Graphs of Odd Degree von Kostochka, Alexandr V., Raspaud, André, Toft, Bjarne, West, Douglas B., Zirlin, Dara

Volltext

Saturation for the 3-uniform loose 3-cycle von English, Sean, Kostochka, Alexandr, Zirlin, Dara

Volltext

Super-pancyclic hypergraphs and bipartite graphs von Kostochka, Alexandr, Luo, Ruth, Zirlin, Dara

Volltext

Acyclic graphs with at least 2ℓ + 1 vertices are ℓ‐recognizable von Kostochka, Alexandr V., Nahvi, Mina, West, Douglas B., Zirlin, Dara

Volltext

Longest cycles in 3‐connected hypergraphs and bipartite graphs von Kostochka, Alexandr, Lavrov, Mikhail, Luo, Ruth, Zirlin, Dara

Volltext

Conditions for a Bigraph to be Super-Cyclic von Kostochka, Alexandr, Lavrov, Mikhail, Luo, Ruth, Zirlin, Dara

Volltext

3-regular graphs are 2-reconstructible von Kostochka, Alexandr V., Nahvi, Mina, West, Douglas B., Zirlin, Dara

Volltext

Lattice Embeddings of Planar Point Sets von Knopf, Michael, Milzman, Jesse, Smith, Derek, Zhu, Dantong, Zirlin, Dara

Volltext

Saturation for the $3$-uniform loose $3$-cycle von English, Sean, Kostochka, Alexandr, Zirlin, Dara

Volltext bestellen

Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable von Kostochka, Alexandr V, Nahvi, Mina, West, Douglas B, Zirlin, Dara

Volltext bestellen

Trees with at least $6\ell+11$ vertices are $\ell$-reconstructible von Kostochka, Alexandr V, Nahvi, Mina, West, Douglas B, Zirlin, Dara

Volltext bestellen

Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable von Kostochka, Alexandr V, Nahvi, Mina, West, Douglas B, Zirlin, Dara

Volltext bestellen

Super-pancyclic hypergraphs and bipartite graphs von Kostochka, Alexandr, Luo, Ruth, Zirlin, Dara

Volltext bestellen

Conditions for a bigraph to be super-cyclic von Kostochka, Alexandr, Lavrov, Mikhail, Luo, Ruth, Zirlin, Dara

Volltext bestellen

Longest cycles in 3-connected hypergraphs and bipartite graphs von Kostochka, Alexandr, Lavrov, Mikhail, Luo, Ruth, Zirlin, Dara

Volltext bestellen

Saturation for the \(3\)-uniform loose \(3\)-cycle von English, Sean, Kostochka, Alexandr, Zirlin, Dara

Volltext

Acyclic graphs with at least \(2\ell+1\) vertices are \(\ell\)-recognizable von Kostochka, Alexandr V, Nahvi, Mina, West, Douglas B, Zirlin, Dara

Volltext

3-Regular Graphs Are 2-Reconstructible von Kostochka, Alexandr V, Nahvi, Mina, West, Douglas B, Zirlin, Dara

Volltext bestellen

Trees with at least \(6\ell+11\) vertices are \(\ell\)-reconstructible von Kostochka, Alexandr V, Nahvi, Mina, West, Douglas B, Zirlin, Dara

Volltext