2002
DOI: 10.1016/s0012-365x(02)00543-5
|View full text |Cite
|
Sign up to set email alerts
|

A sufficient condition for a bipartite graph to be a cube

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 4 publications
0
3
0
Order By: Relevance
“…Because G is connected, the result follows. As noted in [2] and [7], a graph G is a hypercube if and only if G is spherical and bipartite. We aim to substitute this condition for a graph to be spherical with a weaker condition of antipodality and with a local condition for a graph to be a (0, 2)-graph.…”
Section: Bipartite and Antipodal Graphsmentioning
confidence: 99%
See 2 more Smart Citations
“…Because G is connected, the result follows. As noted in [2] and [7], a graph G is a hypercube if and only if G is spherical and bipartite. We aim to substitute this condition for a graph to be spherical with a weaker condition of antipodality and with a local condition for a graph to be a (0, 2)-graph.…”
Section: Bipartite and Antipodal Graphsmentioning
confidence: 99%
“…We give a sufficient conditions for an antipodal bipartite graph to be a regular one. First we give two basic properties of antipodal graphs (see also [7]).…”
Section: Bipartite and Antipodal Graphsmentioning
confidence: 99%
See 1 more Smart Citation