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

DOI10.1017/S0960129522000238OpenAlexW4293561099MaRDI QIDQ5048013FDOQ5048013

Authors: Xin He, Huaming Zhang, Yijie Han 

Publication date: 17 November 2022

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

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

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

zbMATH Keywords

plane graphleft-right pathsPetrie cyclesPetrie tours

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Some simplified NP-complete graph problems
• Title not available (Why is that?)
• Plane graphs with Eulerian Petrie walks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Trees and Euler Tours in a Planar Graph and its Relatives
• Integer-grid maps for reliable quad meshing
• Title not available (Why is that?)
• Full 4-colorings of 4-regular maps
• Optimal decomposition of polygonal models into triangle strips
• Title not available (Why is that?)

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)