This task has not been reviewed, its validity can be dubious.
Dual graph characterization
Task number: 4252
Characterize connected planar graphs that satisfy:
Variant
The dual graph of their arbitrary planar drawing has no loop.
Variant
The dual graph of their arbitrary planar drawing has no loop nor a pair of multiple edges.
