Dual circumference and collinear sets

DOI10.4230/LIPICS.SOCG.2019.29MaRDI QIDQ5088959FDO

Authors Vida Dujmović, Pat Morin

Publication date 18 July 2022

Full work available at URL https://arxiv.org/abs/1811.03427

zbMATH Keywords

planar graphsuntanglingcollinear setscolumn planaritypartial simultaneous geometric drawingsuniversal point subsets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Dual circumference and collinear sets
• Drawing planar graphs with many collinear vertices
• Drawing planar graphs with many collinear vertices

Cites work

• A polynomial bound for untangling geometric planar graphs
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• Circumference of 3-connected cubic graphs
• Column planarity and partial simultaneous geometric embedding
• Column planarity and partially-simultaneous geometric embedding
• Drawing planar graphs with many collinear vertices
• Longest Cycles in 3-Connected 3-Regular Graphs
• Longest cycles in 3-connected cubic graphs
• On Hamiltonian Circuits
• On collinear sets in straight-line drawings
• SEFE without mapping via large induced outerplane graphs in plane graphs
• Shortness exponents of families of graphs
• The four-colour theorem
• The utility of untangling
• Trees in Polyhedral Graphs
• Triangulating planar graphs while minimizing the maximum degree
• Universal point subsets for planar graphs
• Untangling a planar graph
• Untangling a polygon
• Untangling planar graphs from a specified vertex position-Hard cases
• Untangling polygons and graphs
• Upper bound constructions for untangling planar geometric graphs

Cited in

(2)

• Dual Circumference and Collinear Sets
• Dual circumference and collinear sets

This page was built for publication: Dual circumference and collinear sets

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