Some classes of bipartite graphs induced by Gray codes
From MaRDI portal
Recommendations
Cites work
- A construction of Gray codes inducing complete graphs
- A simple proof for the existence of exponentially balanced Gray codes
- Antipodal Gray codes
- Balanced Gray codes
- Balanced Maximum Counting Sequences
- Graphs induced by Gray codes
- scientific article; zbMATH DE number 17941 (Why is no real title available?)
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- scientific article; zbMATH DE number 3248816 (Why is no real title available?)
- On the Optimality of the Binary Reflected Gray Code
- Transition restricted Gray codes
Cited in
(11)- Graphs induced by Gray codes
- Transition restricted Gray codes
- Gray code numbers for graphs
- scientific article; zbMATH DE number 706769 (Why is no real title available?)
- Reconfiguring k-colourings of complete bipartite graphs
- Gray codes for noncrossing and nonnesting partitions of classical types
- scientific article; zbMATH DE number 2239558 (Why is no real title available?)
- Generation of gray codes through the rough identity-summand graph of filters of a rough bi-Heyting algebra
- Characterization of rough identity-summand graph
- Discriminating codes in (bipartite) planar graphs
- A construction of Gray codes inducing complete graphs
This page was built for publication: Some classes of bipartite graphs induced by Gray codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006626)
