Forbidden Subgraphs of the Odd‐Distance Graph

DOI10.1002/jgt.21738zbMath1292.05093OpenAlexW1892717057MaRDI QIDQ5417827

Nam Lê Tiến, Moshe Rosenfeld

Publication date: 22 May 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21738

zbMATH Keywords

geometric graphsforbidden subgraphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items (5)

Odd wheels are not odd-distance graphs ⋮ Odd distances in colourings of the plane ⋮ Minimal graphs with respect to geometric distance realizability ⋮ Odd Wheels Are Not Odd-distance Graphs ⋮ Every 3-colorable graph has a faithful representation in the odd-distance graph

Cites Work

• Unnamed Item
• On coloring the odd-distance graph
• The odd-distance plane graph
• Are There n + 2 Points in E n With Odd Integral Distances?

This page was built for publication: Forbidden Subgraphs of the Odd‐Distance Graph