Relating planar graph drawings to planar satisfiability problems

DOI10.1016/J.IPL.2023.106446MaRDI QIDQ6121427zbMATH OpenOpenAlexFDO

Authors Md. Manzurul Hasan, Debajyoti Mondal, Md. Saidur Rahman

Publication date 26 March 2024

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2023.106446

zbMATH Keywords

algorithmsplanar graphgraph drawingSAT problems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 2123122 (Why is no real title available?)
• scientific article; zbMATH DE number 4094812 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• A special planar satisfiability problem and a consequence of its NP- completeness
• Box-rectangular drawings of planar graphs
• Efficient algorithms for Petersen's matching theorem
• Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
• Orthogonal Drawings of Plane Graphs Without Bends
• Positive planar satisfiability problems under 3-connectivity constraints
• Rectangular drawings of planar graphs
• The unit bar visibility number of a graph
• Theory and Applications of Satisfiability Testing

This page was built for publication: Relating planar graph drawings to planar satisfiability problems

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