Relating planar graph drawings to planar satisfiability problems

DOI10.1016/j.ipl.2023.106446OpenAlexW4386827762MaRDI QIDQ6121427

Debajyoti Mondal, Md. Manzurul Hasan, 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A special planar satisfiability problem and a consequence of its NP- completeness
• Positive planar satisfiability problems under 3-connectivity constraints
• Efficient Algorithms for Petersen's Matching Theorem
• The Unit Bar Visibility Number of a Graph
• Box-Rectangular Drawings of Planar Graphs
• Orthogonal Drawings of Plane Graphs Without Bends
• Rectangular drawings of planar graphs
• Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
• Theory and Applications of Satisfiability Testing