2 citations · 2 across the 5 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019
3-Regular Graphs Are 2-Reconstructible
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1
A graph is -reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting vertices. We prove that -regular graphs are -reconstruc…
math.CO2019
Super-pancyclic hypergraphs and bipartite graphs
Alexandr Kostochka, Ruth Luo, Dara Zirlin
We find Dirac-type sufficient conditions for a hypergraph with few edges to be hamiltonian. We also show that these conditions provide that is {\em super-…
math.CO2019
Degree lists and connectedness are -reconstructible for graphs with at least seven vertices
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1
The -deck of a graph is the multiset of its subgraphs induced by vertices. A graph or graph property is -reconstructible if it is determined by the deck of subgraphs obta…