research
∙
06/06/2023
Infinite families of k-vertex-critical (P_5, C_5)-free graphs
A graph is k-vertex-critical if χ(G)=k but χ(G-v)<k for all v∈ V(G). We ...
share
research
∙
12/09/2022
A refinement on the structure of vertex-critical (P_5, gem)-free graphs
We give a new, stronger proof that there are only finitely many k-vertex...
research
∙
08/22/2022
A Tight Upper Bound on the Average Order of Dominating Sets of a Graph
In this paper we study the the average order of dominating sets in a gra...
research
∙
06/07/2022
Vertex-critical (P_3+ℓ P_1)-free and vertex-critical (gem, co-gem)-free graphs
A graph G is k-vertex-critical if χ(G)=k but χ(G-v)<k for all v∈ V(G) wh...
research
∙
05/05/2022
Cut-Down de Bruijn Sequences
A cut-down de Bruijn sequence is a cyclic string of length L, where 1 ≤ ...
research
∙
02/03/2022
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan
We consider the problem of listing all spanning trees of a graph G such ...
research
∙
08/20/2021
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph
We use a greedy strategy to list the spanning trees of the fan graph, F_...
research
∙
03/16/2021
A Hamilton Cycle in the k-Sided Pancake Network
We present a Hamilton cycle in the k-sided pancake network and four comb...
research
∙
06/30/2020