2 citations · 2 across the 2 of their papers we have counts for
3 papers
math.CO2026
Degeneracy: From Graphs to Matroids
Allan Bickle, James Dylan Douthitt, Wayne Ge +1
A graph is -degenerate if every subgraph has a vertex of degree at most . We extend this notion to matroids, defining a loopless matroid to be -degenerate if every res…
math.CO2022★ 2 cited
Plane Triangulations Without Spanning 2-Trees
Allan Bickle
A 2-tree is a graph that can be formed by starting with a triangle and iterating the operation of making a new vertex adjacent to two adjacent vertices of the existing graph. Leizh…
math.CO2019
Wiener indices of maximal -degenerate graphs
Allan Bickle, Zhongyuan Che
A graph is maximal -degenerate if each induced subgraph has a vertex of degree at most and adding any new edge to the graph violates this condition. In this paper, we provid…