✦ LIBER ✦

On the Pfaffian Number of Graphs

✍ Scribed by Alberto Alexandre Assis Miranda; Cláudio Leonardo Lucchesi

Book ID: 108120739
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 200 KB
Volume: 35
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2009.11.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pfaffian graphs,T-joins and crossing num

Pfaffian graphs,T-joins and crossing numbers

✍ Serguei Norine 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 202 KB

Pfaffian graphs embedding on the torus

✍ Zhang, LianZhu; Wang, Yan; Lu, FuLiang 📂 Article 📅 2012 🏛 SP Science China Press 🌐 English ⚖ 298 KB

Drawing 4-Pfaffian graphs on the torus

✍ Serguei Norine 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 452 KB

The Pfaffian property of Cartesian produ

The Pfaffian property of Cartesian products of graphs

✍ Fuliang Lu, Lianzhu Zhang 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 521 KB

A Characterisation of Pfaffian Near Bipa

A Characterisation of Pfaffian Near Bipartite Graphs

✍ Ilse Fischer; Charles H.C. Little 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 622 KB

A graph is 1-extendible if every edge has a 1-factor containing it. A 1-extendible non-bipartite graph G is said to be near bipartite if there exist edges e 1 and e 2 such that G&[e 1 , e 2 ] is 1-extendible and bipartite. We characterise the Pfaffian near bipartite graphs in terms of forbidden subg

Computing the permanental polynomials of

Computing the permanental polynomials of bipartite graphs by Pfaffian orientation

✍ Heping Zhang; Wei Li 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 232 KB