A conjecture of Norine and Thomas for abelian Cayley graphs
From MaRDI portal
Publication:2409829
zbMath1372.05101MaRDI QIDQ2409829
Publication date: 16 October 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p65
05C30: Enumeration in graph theory
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Pfaffian graphs embedding on the torus
- The Pfaffian property of circulant graphs
- Minimally non-Pfaffian graphs
- Pfaffian orientation and enumeration of perfect matchings for some Cartesian products of graphs
- On 1-factorizability of Cayley graphs
- Matching theory
- Hamiltonian decompositions of Cayley graphs on Abelian groups
- Hamiltonian decompositions of Cayley graphs on abelian groups of even order
- Pólya's permanent problem
- Pseudo-Cartesian products and Hamiltonian decompositions of Cayley graphs on abelian groups
- A characterization of convertible (0,1)-matrices
- A characterisation of Pfaffian near bipartite graphs
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
- A generalization of Little's theorem on Pfaffian orientations
- Permanents, Pfaffian orientations, and even directed circuits
- The Pfaffian property of Cartesian products of graphs
- Enumeration of perfect matchings of a type of Cartesian products of graphs
- The statistics of dimers on a lattice
- A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs
- Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
