IEICE TRANSACTIONS on Fundamentals
Convex Bipartite Graphs and Bipartite Circle Graphs
Summary :
Let G = (A, B, E) be a bipartite graph with bipartition (A:B) of vertex set and edge set E. For each vertex v, Γ(v) denotes the set of adjacent vertices to v. G is said to be t-convex on the vertex set A if there is a tree and a one-to-one correspondence between vertices in A and edges of the tree such that for each vertex b
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.5 pp.789-795
- Publication Date
- 1998/05/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takashi KIZU, Yasuchika HARUTA, Toshiro ARAKI, Toshinobu KASHIWABARA, "Convex Bipartite Graphs and Bipartite Circle Graphs" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 5, pp. 789-795, May 1998, doi: .
Abstract: Let G = (A, B, E) be a bipartite graph with bipartition (A:B) of vertex set and edge set E. For each vertex v, Γ(v) denotes the set of adjacent vertices to v. G is said to be t-convex on the vertex set A if there is a tree and a one-to-one correspondence between vertices in A and edges of the tree such that for each vertex b
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_5_789/_p
Copy
@ARTICLE{e81-a_5_789,
author={Takashi KIZU, Yasuchika HARUTA, Toshiro ARAKI, Toshinobu KASHIWABARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Convex Bipartite Graphs and Bipartite Circle Graphs},
year={1998},
volume={E81-A},
number={5},
pages={789-795},
abstract={Let G = (A, B, E) be a bipartite graph with bipartition (A:B) of vertex set and edge set E. For each vertex v, Γ(v) denotes the set of adjacent vertices to v. G is said to be t-convex on the vertex set A if there is a tree and a one-to-one correspondence between vertices in A and edges of the tree such that for each vertex b
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Convex Bipartite Graphs and Bipartite Circle Graphs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 789
EP - 795
AU - Takashi KIZU
AU - Yasuchika HARUTA
AU - Toshiro ARAKI
AU - Toshinobu KASHIWABARA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 1998
AB - Let G = (A, B, E) be a bipartite graph with bipartition (A:B) of vertex set and edge set E. For each vertex v, Γ(v) denotes the set of adjacent vertices to v. G is said to be t-convex on the vertex set A if there is a tree and a one-to-one correspondence between vertices in A and edges of the tree such that for each vertex b
ER -
English
