Some classes of bipartite graphs induced by Gray codes
From MaRDI portal
Publication:5006626
DOI10.5614/ejgta.2017.5.2.12zbMath1467.05148OpenAlexW2767128756MaRDI QIDQ5006626
Publication date: 16 August 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2017.5.2.12
bipartite graphcomplete bipartite graphHamiltonian cycleHamiltonian pathgray codegraph of transition
Cites Work
- A construction of Gray codes inducing complete graphs
- Balanced Gray codes
- Antipodal Gray codes
- Graphs induced by Gray codes
- Transition restricted Gray codes
- A simple proof for the existence of exponentially balanced Gray codes
- On the Optimality of the Binary Reflected Gray Code
- Balanced Maximum Counting Sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some classes of bipartite graphs induced by Gray codes