Jump to Content
Your Recent History
View Cart
Logged Out Log In
SIAM J. Discrete Math. 21, pp. 26-32 (7 pages)
Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookFor a partial cube $G$ its crossing graph $G^\#$ is the graph whose vertices are the ϴ‐classes of $G$, two classes being adjacent if they cross on some cycle in $G$. The following problem posed in [S. Klavžar and H. M. Mulder, SIAM J. Discrete Math., 15 (2002), pp. 235–251, Problem 7.1] is considered: What can be said about the partial cube $G$ if $G^\#$ is the join $A\oplus B$ of graphs $A$ and $B$ with at least one edge? It is proved that for arbitrary graphs $A$ and $B$, where at least one of them contains an edge, there exists a Cartesian prime partial cube $G$ such that $G^\# = A\oplus B$. On the other hand, if $G$ is a median graph, then $G^\# = A\oplus B$ if and only if $G=H\,\square\, K$, where $H^\# = A$ and $K^\# = B$. Along the way some new facts about partial cubes are obtained; for instance, a bipartite graph of radius 2 is a partial cube if and only if it is $K_{2,3}$‐free.
© 2007 Society for Industrial and Applied Mathematics
RELATED DATABASES
To view database links for this article,
you need to log in.
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
History
Received January 20, 2005
Accepted April 25, 2006
Published online January 08, 2007
Accepted April 25, 2006
Published online January 08, 2007
Permalink
For access to fully linked references, you need to log in.
ALL SIAM Content
Scitation
Google Scholar