Note on Hamiltonicity of Basis Graphs of Even Delta‐Matroids
Open Access
- 20 March 2025
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 109 (4) , 446-453
Abstract
We show that the basis graph of an even delta‐matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges and sharing a common end, it has a Hamiltonian cycle using and avoiding unless it has at most two vertices or it is a cycle of length at most four. We also prove that if the basis graph is not a hypercube graph, then each vertex belongs to cycles of every length , and each edge belongs to cycles of every length . For the last theorem, we provide two proofs, one of which uses the result of Naddef (1984) on polytopes and the result of Chepoi (2007) on basis graphs of even delta‐matroids, and the other is a direct proof using various properties of even delta‐matroids. Our theorems generalize the analogous results for matroids by Holzmann and Harary (1972) and Bondy and Ingleton (1976).Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Excluding a bipartite circle graph from line graphsJournal of Graph Theory, 2008
- Coxeter Matroids2003
- Multimatroids III. Tightness and Fundamental GraphsEuropean Journal of Combinatorics, 2001
- Maurer's Homotopy Theory and Geometric Algebra for Even Δ-MatroidsAdvances in Applied Mathematics, 1996
- PseudomatroidsDiscrete Mathematics, 1988
- Greedy algorithm and symmetric matroidsMathematical Programming, 1987
- Some combinatorial properties of discriminants in metric vector spacesAdvances in Mathematics, 1986
- Pancyclic graphs IIJournal of Combinatorial Theory, Series B, 1976
- Matroid basis graphs. IIJournal of Combinatorial Theory, Series B, 1973
- Matroid basis graphs. IJournal of Combinatorial Theory, Series B, 1973