4 citations · 6 across the 10 of their papers we have counts for
5 papers · 1 filter
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…
On the bar visibility number of complete bipartite graphs
Weiting Cao, Douglas B. West, Yan Yang
A -bar visibility representation of a graph assigns each vertex up to horizontal bars in the plane so that two vertices are adjacent if and only if some bar for one vertex c…
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…
Upper bounds for bar visibility of subgraphs and n-vertex graphs
Yuanrui Feng, Douglas B. West, Yan Yang
A -bar visibility representation of a graph assigns each vertex up to horizontal bars in the plane so that two vertices are adjacent if and only if some bar for one vertex c…
Largest 2-regular subgraphs in 3-regular graphs
Ilkyoo Choi, Ringi Kim, Alexandr Kostochka +2
For a graph , let denote the largest number of vertices in a -regular subgraph of . We determine the minimum of over -regular -vertex simple graphs…