Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the Euclidean dimension of a complete multipartite graph

From MaRDI portal
Publication:1110525
Jump to:navigation, search

DOI10.1016/0012-365X(88)90217-8zbMath0657.05022OpenAlexW1983501674MaRDI QIDQ1110525

Hiroshi Maehara

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90217-8

zbMATH Keywords

complete bipartite graphscomplete tripartite graphsEuclidean dimensionEuclidean n-space


Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)


Related Items

Note on induced subgraphs of the unit distance graph \(E^ n\), Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\), Representations of graphs and networks (coding, layouts and embeddings), Minimal Embedding Dimensions of Rectangle k-Visibility Graphs, On the Computational Complexity of Degenerate Unit Distance Representations of Graphs, Products of unit distance graphs, The Euclidean dimension of the join of two cycles, Unnamed Item, On the dimension to represent a graph by a unit distance graph



Cites Work

  • Contact patterns of equal nonoverlapping spheres
  • On the Euclidean dimension of a wheel
  • On the dimension of a graph
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1110525&oldid=13150346"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 03:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki