2 papers
math.CO2026
Maximal Hamiltonicity of realization graphs of degree sequences
Jeffrey S. Baggett
We prove that the realization graph of every graphical degree sequence is maximally Hamiltonian: it is Hamilton-laceable when bipartite on more than one vertex, and Hamilton-connec…
math.CO2026
Interchange graphs of (0,1)-matrices are maximally Hamiltonian
Jeffrey S. Baggett, Huiya Yan
For integer vectors R,S let A(R,S) denote the class of (0,1)-matrices with row sum vector R and column sum vector S. Its interchange graph G(R,S) has A(R,S) as its vertex set, two…