✦ LIBER ✦

On Tutte polynomials and cycles of plane graphs

✍ Scribed by François Jaeger

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 901 KB
Volume: 44
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(88)90083-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Graphs Determined by Their Tutte Poly

On Graphs Determined by Their Tutte Polynomials

✍ Anna de Mier; Marc Noy 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 347 KB

Hamiltonian cycle is polynomial on cocom

Hamiltonian cycle is polynomial on cocomparability graphs

✍ Jitender S. Deogun; George Steiner 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 705 KB

On the evaluation at (3, 3) of the Tutte

On the evaluation at (3, 3) of the Tutte polynomial of a graph

✍ Michel Las Vergnas 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 277 KB

On coefficients of the Tutte polynomial

✍ John W. Leo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 781 KB

The Penrose polynomial of a plane graph

✍ Martin Aigner 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 430 KB

The 4-Choosability of Plane Graphs witho

The 4-Choosability of Plane Graphs without 4-Cycles

✍ Peter Che Bor Lam; Baogang Xu; Jiazhuang Liu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 179 KB

A graph G is called k-choosable if k is a number such that if we give lists of k colors to each vertex of G there is a vertex coloring of G where each vertex receives a color from its own list no matter what the lists are. In this paper, it is shown that each plane graph without 4-cycles is 4-choosa