The following pages link to Ben Cameron (Q831868):
Displaying 22 items.
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (Q831869) (← links)
- (Q1699566) (redirect page) (← links)
- On the unimodality of independence polynomials of very well-covered graphs (Q1699567) (← links)
- On the stability of independence polynomials (Q1753011) (← links)
- A note on purely imaginary independence roots (Q2005699) (← links)
- A Hamilton cycle in the \(k\)-sided pancake network (Q2115848) (← links)
- Maximum modulus of independence roots of graphs and trees (Q2175814) (← links)
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality (Q2689255) (← links)
- A pivot Gray code listing for the spanning trees of the fan graph (Q2695273) (← links)
- (Q3451441) (← links)
- Independence Equivalence Classes of Paths and Cycles (Q5206913) (← links)
- A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs (Q6039897) (← links)
- On the mean subtree order of graphs under edge addition (Q6055400) (← links)
- The node cop‐win reliability of unicyclic and bicyclic graphs (Q6065860) (← links)
- Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs (Q6121915) (← links)
- Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs (Q6180578) (← links)
- Dichotomizing $k$-vertex-critical $H$-free graphs for $H$ of order four (Q6344141) (← links)
- An approximation algorithm for zero forcing (Q6521716) (← links)
- On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls (Q6523275) (← links)
- Pivot Gray codes for the spanning trees of a graph ft. the fan (Q6580496) (← links)
- Cut-down de Bruijn sequences (Q6635080) (← links)
- A tight upper bound on the average order of dominating sets of a graph (Q6642500) (← links)
