On embedding triconnected cubic graphs on point sets

DOI10.1016/j.endm.2007.07.081zbMath1341.05137OpenAlexW2089347916WikidataQ61732492 ScholiaQ61732492MaRDI QIDQ3503515

Clemens Huemer, Pavel Valtr, Ferran Hurtado, F. Javier Tejel, Alfredo Daniel Garcia

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.081

zbMATH Keywords

geometric graphscubic graphs3-connected graphsembeddings in the plane

Mathematics Subject Classification ID

Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES ⋮ Point-set embeddings of plane \(3\)-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Degree constrained tree embedding into points in the plane
• Straight-line embeddings of two rooted trees in the plane
• The rooted tree embedding problem into points in the plane
• On embedding an outer-planar graph in a point set
• Research Problems in Discrete Geometry
• Optimal Algorithms to Embed Trees in a Point Set
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Embedding planar graphs at fixed vertex locations