In this note we present a formulation of two related combinatorial embedding problems concerning level graphs in terms of CNF-formulas. The first problem is known as level planar embedding and the second as crossing-minimization-problem.
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Applied Mathematics
- 2CNF, level graphs
- Level-planar, crossing-minimization