On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs

DOI10.1017/S0960129522000238MaRDI QIDQ5048013zbMATH OpenOpenAlexFDO

Authors Xin He, Huaming Zhang, Yijie Han

Publication date 17 November 2022

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/s0960129522000238

zbMATH Keywords

plane graphleft-right pathsPetrie cyclesPetrie tours

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Plane graphs with Eulerian Petrie walks
• scientific article; zbMATH DE number 638642
• Cell decompositions of the projective plane with Petrie polygons of constant length
• A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
• scientific article; zbMATH DE number 1536523

Cites work

• scientific article; zbMATH DE number 3882451 (Why is no real title available?)
• scientific article; zbMATH DE number 3144962 (Why is no real title available?)
• scientific article; zbMATH DE number 3769647 (Why is no real title available?)
• scientific article; zbMATH DE number 3480634 (Why is no real title available?)
• scientific article; zbMATH DE number 638642 (Why is no real title available?)
• Full 4-colorings of 4-regular maps
• Integer-grid maps for reliable quad meshing
• Optimal decomposition of polygonal models into triangle strips
• Plane graphs with Eulerian Petrie walks
• Some simplified NP-complete graph problems
• Trees and Euler Tours in a Planar Graph and its Relatives

Cited in

(2)

• A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
• Plane graphs with Eulerian Petrie walks

This page was built for publication: On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048013)