HIGHLIGHTS
- who: PA P E R and collaborators from the of Computer Science and, State University of New York at Buffalo, Buffalo, NY, USA have published the research: On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs, in the Journal: (JOURNAL)
- what: The authors show the problem of determining if a input 4-regular plane graph is Petrie partitionable is NP-complete. The focus of the study is on the graph-theoretical properties of these problems. By the same argument, each of them defines a distinct Petrie cycle partition of G . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.