Ben Cameron

Theor. Comput. Sci., 2025

Cut-down de Bruijn sequences.

[BibT_eX]

[DOI]

Aysu Gündogan

Discret. Math., 2025

Vertex-Critical (P5,W4)-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 2025

2024

Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan.

[BibT_eX]

[DOI]

Aaron Grubb

Graphs Comb., August, 2024

Infinite Families of k-Vertex-Critical (P5, C5)-Free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., April, 2024

Vertex-critical (P3+ℓP1)-free and vertex-critical (gem, co-gem)-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., February, 2024

A tight upper bound on the average order of dominating sets of a graph.

[BibT_eX]

[DOI]

Iain Beaton

J. Graph Theory, 2024

On the Finiteness of k-Vertex-Critical 2P2-Free Graphs with Forbidden Induced Squids or Bulls.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023

A refinement on the structure of vertex-critical (P5, gem)-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., June, 2023

Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality.

[BibT_eX]

[DOI]

Algorithmica, March, 2023

2022

The node cop-win reliability of unicyclic and bicyclic graphs.

[BibT_eX]

[DOI]

Maimoonah Ahmed

Networks, 2022

Dichotomizing k-vertex-critical H-free graphs for H of order four.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

A refinement on the structure of vertex-critical (P5, gem)-free graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Vertex-critical (P3+𝓁P1)-free and vertex-critical (gem, co-gem)-free graphs.

[BibT_eX]

[DOI]

CoRR, 2022

2021

On the mean subtree order of graphs under edge addition.

[BibT_eX]

[DOI]

Lucas Mol

J. Graph Theory, 2021

A Hamilton Cycle in the k-Sided Pancake Network.

[BibT_eX]

[DOI]

Aaron Williams

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph.

[BibT_eX]

[DOI]

Aaron Grubb

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Maximum Modulus of Independence Roots of Graphs and Trees.

[BibT_eX]

[DOI]

Graphs Comb., 2020

A note on purely imaginary independence roots.

[BibT_eX]

[DOI]

Discret. Math., 2020

2019

Independence equivalence classes of paths and cycles.

[BibT_eX]

[DOI]

Iain Beaton

Australas. J Comb., 2019

2018

On the unimodality of independence polynomials of very well-covered graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

On the Stability of Independence Polynomials.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2015

Edge contraction and cop-win critical graphs.

[BibT_eX]

[DOI]