On maximal and minimal triangular planar graphs: an optimization approach

DOI10.1080/0020739930240302MaRDI QIDQ4281812zbMATH OpenOpenAlexFDO

Authors Sydney C. K. Chu

Publication date 10 March 1994

Published in International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020739930240302

zbMATH Keywords

knapsackoptimization problemtriangular planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Programming involving graphs or networks (90C35)

Recommendations

• Triangulating planar graphs while minimizing the maximum degree
• On maximal cycles or triangular planar polygonal graphs and their coloring
• Minimizing the number of triangular edges
• Optimal 1-planar graphs which triangulate other surfaces
• One strike against the min-max degree triangulation problem

Cites work

• Algorithms for Scheduling Independent Tasks
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The Theory and Computation of Knapsack Functions

Cited in

(3)

• Evolved minimalist art and maximal planar graphs
• On Optimal 2- and 3-Planar Graphs
• Triangulating planar graphs while minimizing the maximum degree

This page was built for publication: On maximal and minimal triangular planar graphs: an optimization approach

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