Opening book details…
Can I read 2-Walks in Circuit Graphs on EtoBox?
2-Walks in Circuit Graphs by Z.C. Gao; R.B. Richter is a Computer Science article available to read on EtoBox.
What is 2-Walks in Circuit Graphs about?
We prove the conjecture of Jackson and Wormald that every 3-connected planar graph has a closed walk visiting every vertex once or twice. This strengthens Barnette's Theorem that every 3-connected planar graph has a spanning tree with maximum degree at most 3 . The result also holds for 3 -connected projective planar graphs. 1994 Academic Press, Inc.
Who reads 2-Walks in Circuit Graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Z.C. Gao; R.B. Richter
- Publisher
- Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0095-8956)
- Published
- 1994
- Language
- EN
- Field
- Computer Science (Physical Sciences)