The flipping puzzle on a graph

DOI10.1016/j.ejc.2009.08.001zbMath1226.05237arXiv0808.2104OpenAlexW2105550682MaRDI QIDQ992785

Chih-Wen Weng, Hau-Wen Huang

Publication date: 10 September 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0808.2104

zbMATH Keywords

connected graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Lit-only \(\sigma \)-game on pseudo-trees ⋮ The edge-flipping group of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum light number of lit-only \(\sigma\)-game on a tree
• Vogan diagrams of real forms of affine Kac-Moody Lie algebras
• Level-two structure of simply-laced Coxeter groups.
• Equivalence classes of Vogan diagrams
• Invariants of real forms of affine Kac-Moody Lie algebras
• Lit-only sigma-game on nondegenerate graphs
• Orbits of groups generated by transvections over \(\mathbb{F}_2\).
• Extended Vogan diagrams
• Lit-only sigma game on a line graph
• Some subgroups of \(SI_ n(F_2)\)
• Some groups generated by transvections
• GRAPHS AND NIELSEN TRANSFORMATIONS OF SYMMETRIC, ORTHOGONAL, AND SYMPLECTIC GROUPS
• Orbits Under Symplectic Transvections I
• Lie Algebras of Characteristic 2
• Lie groups beyond an introduction

This page was built for publication: The flipping puzzle on a graph