scientific article; zbMATH DE number 1420915

MaRDI QIDQ4944987zbMATH OpenFDO

Authors Anna Accornero, Massimo Ancona, Sonia Varini

Publication date 3 August 2000

zbMATH Keywords

algorithmcrossover verticesgraph coveringplane graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• All separating triangles in a plane graph can be optimally ``broken in polynomial time
• Rectangular duals of planar graphs
• On Finding the Rectangular Duals of Planar Triangular Graphs
• scientific article; zbMATH DE number 975400
• Rectangular drawings of plane graphs without designated corners

Cited in

(1)

• All separating triangles in a plane graph can be optimally ``broken in polynomial time

This page was built for publication:

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