期刊文献+

Pfaffian graphs embedding on the torus 被引量:2

Pfaffian graphs embedding on the torus
原文传递
导出
摘要 An orientation of a graph G with even number of vertices is Pfaffian if every even cycle C such that G-V(C) has a perfect matching has an odd number of edges directed in either direction of the cycle. The significance of Pfaffian orientations stems from the fact that if a graph G has one, then the number of perfect matchings of G can be computed in polynomial time. There is a classical result of Kasteleyn that every planar graph has a Pfaffian orientation. Little proved an elegant characterization of bipartite graphs that admit a Pfaffian orientation. Robertson, Seymour and Thomas (1999) gave a polynomial-time recognition algorithm to test whether a bipartite graph is Pfaffian by a structural description of bipartite graphs. In this paper, we consider the Pfaffian property of graphs embedding on the orientable surface with genus one (i.e., the torus). Some sufficient conditions for Pfaffian graphs on the torus are obtained. Furthermore, we show that all quadrilateral tilings on the torus are Pfaffian if and only if they are not bipartite graphs. An orientation of a graph G with even number of vertices is Pfaffian if every even cycle C such that G-V(C) has a perfect matching has an odd number of edges directed in either direction of the cycle. The significance of Pfaffian orientations stems from the fact that if a graph G has one, then the number of perfect matchings of G can be computed in polynomial time. There is a classical result of Kasteleyn that every planar graph has a Pfaffian orientation. Little proved an elegant characterization of bipartite graphs that admit a Pfaffian orientation. Robertson, Seymour and Thomas (1999) gave a polynomial-time recognition algorithm to test whether a bipartite graph is Pfaffian by a structural description of bipartite graphs. In this paper, we consider the Pfaffian property of graphs embedding on the orientable surface with genus one (i.e., the torus). Some sufficient conditions for Pfaffian graphs on the torus are obtained. Furthermore, we show that all quadrilateral tilings on the torus are Pfaffian if and only if they are not bipartite graphs.
出处 《Science China Mathematics》 SCIE 2013年第9期1957-1964,共8页 中国科学:数学(英文版)
基金 National Natural Science Foundation of China (Grant Nos. 10831001 and 11171279) the Scientific Research Foundation of Zhangzhou Normal University (Grant No. SX1002)
关键词 Pfaffian graph perfect matching crossing orientation 圆环 多项式时间 二分图 边缘定向 完美匹配 识别算法 结构描述 曲面嵌入
  • 相关文献

参考文献2

二级参考文献39

  • 1Catalano D A,Conder M D E,Du S F, et al.Classification of regular embeddings of n-dimensional cubes. J Algeb Combin . 2010
  • 2Du S F,Jones G A,Kwak, J H, et al.Regular embeddings of K n,n where n is a power of 2, II: Nonmetacyclic case. Euro J Combin . 2010
  • 3Du S F,Kwak J H,Nedela R.A Classification of regular embeddings of graphs of order a product of two primes. J Algeb Combin . 2004
  • 4Du S F,Kwak J H,Nedela R.Classification of regular embeddings of hypercubes of odd dimension. Discrete Mathematics . 2007
  • 5James L D,Jones G A.Regular orientable imbeddings of complete graphs. Journal of Combinatorial Theory Series B . 1985
  • 6Jones G A.Regular embeddings of complete bipartite graphs: classification and enumeration. Proceedings of the London Mathematical Society .
  • 7Jones G A.Automorphisms and regular embeddings of merged Johnson graphs. Euro J Combin . 2005
  • 8Jones G A,Nedela R,Skoviera M.Complete bipartite graphs with unique regular embeddings. Journal of Combinatorial Theory Series B . 2008
  • 9Kwak J H,Kwon Y S.Classification of nonorientable regular embeddings complete bipartite graphs. .
  • 10Kwon Y S.New regular embeddings of n-cubes Q n. Journal of Graph Theory . 1999

共引文献3

同被引文献2

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部