The spanning maximal planar subgraph problem for some classes of complete 4-partite graphs

DOI10.1007/978-981-16-6890-6_45zbMATH Open1498.05075OpenAlexW4225435630MaRDI QIDQ2079986FDOQ2079986

Authors: Tjaart Jan B. Estrada, Isagani B. Jos 

Publication date: 7 October 2022

Full work available at URL: https://doi.org/10.1007/978-981-16-6890-6_45

Recommendations

• Spanning maximal planar subgraphs of random graphs
• scientific article; zbMATH DE number 861354
• scientific article; zbMATH DE number 1953097
• scientific article; zbMATH DE number 1501098
• Maximal planar subgraphs of fixed girth in random graphs

zbMATH Keywords

maximal planar graphcomplete 4-partite graphspanning maximal planar subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
• Title not available (Why is that?)
• N-flips in even triangulations on the sphere
• Generation of Triangulations of the Sphere
• On generating planar graphs
• A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs

Cited In (1)

• There are Plane Spanners of Maximum Degree 4

This page was built for publication: The spanning maximal planar subgraph problem for some classes of complete 4-partite graphs

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