Dara Zirlin

MaRDI QIDQ2175783zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Trees with at least \(6\ell +11\) vertices are \(\ell\)-reconstructible Graphs and Combinatorics	2026-01-29	Paper
Saturation for the 3-uniform loose 3-cycle Discrete Mathematics	2023-11-27	Paper
Longest cycles in 3‐connected hypergraphs and bipartite graphs Journal of Graph Theory	2023-10-05	Paper
Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable	2023-08-08	Paper
Trees with at least $6\ell+11$ vertices are $\ell$-reconstructible	2023-07-19	Paper
\(3\)-reconstructibility of rooted trees Pure and Applied Mathematics Quarterly	2023-04-05	Paper
Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable	2021-03-22	Paper
Cut-edges and regular factors in regular graphs of odd degree Graphs and Combinatorics	2021-03-17	Paper
Cut-edges and regular factors in regular graphs of odd degree Graphs and Combinatorics	2021-03-17	Paper
3-regular graphs are 2-reconstructible European Journal of Combinatorics	2021-02-08	Paper
Conditions for a bigraph to be super-cyclic The Electronic Journal of Combinatorics	2021-01-29	Paper
Super-pancyclic hypergraphs and bipartite graphs Journal of Combinatorial Theory. Series B	2020-09-24	Paper
Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices Graphs and Combinatorics	2020-04-30	Paper
Lattice embeddings of planar point sets Discrete & Computational Geometry	2016-10-27	Paper

Research outcomes over time

This page was built for person: Dara Zirlin