Opening book details…
Can I read Tutte Paths and Long Cycles in Circuit Graphs on EtoBox?
Tutte Paths and Long Cycles in Circuit Graphs by Michael C. Wigal; Xingxing Yu is a Computer Science article available to read on EtoBox.
What is Tutte Paths and Long Cycles in Circuit Graphs about?
Thomassen proved that 4-connected planar graphs are Hamilton connected by showing that every 2-connected planar graph G contains a Tutte path P between any two given vertices, that is, every component of G -P has at most three neighbors on P . In this paper, we prove a quantitative version of this result for circuit graphs, a natural class of planar graphs which includes all 3-connected planar graphs, by further controlling the number of components in G -P . We also give an application of this result by providing a best possible bound for the circumference of essentially 4-connected planar graphs.
Who reads Tutte Paths and Long Cycles in Circuit Graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Michael C. Wigal; Xingxing Yu
- Publisher
- Elsevier BV
- Published
- 2023
- Language
- EN
- Field
- Computer Science (Physical Sciences)