Transformations for maximal planar graphs with minimum degree five

DOI10.1007/BFB0030852MaRDI QIDQ6085725zbMATH OpenOpenAlexFDO

Authors Jean Hardouin-Duparc

Publication date 12 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0030852

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Four coloring for a subset of maximal planar graphs with minimum degree five
• scientific article; zbMATH DE number 4183439
• Construction of planar triangulations with minimum degree 5
• scientific article; zbMATH DE number 558327
• scientific article; zbMATH DE number 3843770

Cites work

• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3404264 (Why is no real title available?)
• Generating rooted triangulations without repetitions
• Heuristic for rapidly four-coloring large planar graphs
• Reverse search for enumeration

Cited in

(1)

• Four coloring for a subset of maximal planar graphs with minimum degree five

This page was built for publication: Transformations for maximal planar graphs with minimum degree five

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