IEICE TRANSACTIONS on transactions
Finding a Maximal Outerplanar Spanning Subgraph of a Graph
Summary :
A graph is said to be outerplanar if it has a planar embedding in which all vertices lie on the exterior face. For a graph G=(V, E), its spanning subgraph G
- Publication
- IEICE TRANSACTIONS on transactions Vol.E73-E No.4 pp.532-538
- Publication Date
- 1990/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Algorithm, Data Structure and Computational Complexity
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
Sumio MASUDA, Toshinobu KASHIWABARA, "Finding a Maximal Outerplanar Spanning Subgraph of a Graph" in IEICE TRANSACTIONS on transactions,
vol. E73-E, no. 4, pp. 532-538, April 1990, doi: .
Abstract: A graph is said to be outerplanar if it has a planar embedding in which all vertices lie on the exterior face. For a graph G=(V, E), its spanning subgraph G
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_4_532/_p
Copy
@ARTICLE{e73-e_4_532,
author={Sumio MASUDA, Toshinobu KASHIWABARA, },
journal={IEICE TRANSACTIONS on transactions},
title={Finding a Maximal Outerplanar Spanning Subgraph of a Graph},
year={1990},
volume={E73-E},
number={4},
pages={532-538},
abstract={A graph is said to be outerplanar if it has a planar embedding in which all vertices lie on the exterior face. For a graph G=(V, E), its spanning subgraph G
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Finding a Maximal Outerplanar Spanning Subgraph of a Graph
T2 - IEICE TRANSACTIONS on transactions
SP - 532
EP - 538
AU - Sumio MASUDA
AU - Toshinobu KASHIWABARA
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 4
JA - IEICE TRANSACTIONS on transactions
Y1 - April 1990
AB - A graph is said to be outerplanar if it has a planar embedding in which all vertices lie on the exterior face. For a graph G=(V, E), its spanning subgraph G
ER -
English
