Minimal graphs with respect to geometric distance realizability

DOI10.7151/dmgt.2176zbMath1453.05076OpenAlexW2899338909WikidataQ128974587 ScholiaQ128974587MaRDI QIDQ2214306

Pavol Široczki, Tomáš Madaras

Publication date: 8 December 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2176

zbMATH Keywords

Euclidean planeunit-distance graphodd-distance graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• The maximum number of odd integral distances between points in the plane
• Two notions of unit distance graphs
• On computational complexity of length embeddability of graphs
• On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
• The Mathematical Coloring Book
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• Are There n + 2 Points in E n With Odd Integral Distances?
• Forbidden Subgraphs of the Odd‐Distance Graph
• On the dimension of a graph

This page was built for publication: Minimal graphs with respect to geometric distance realizability