In this paper we present polynomial time algorithms for the following three problems on a Hamilton graph with a prescribed Hamilton circuit: (1) Given a Hamilton graph G with a prescribed Hamilton circuit, find a maximal planar Hamilton subgraph of G, (2) Given a Hamilton graph G and a planar Hamilton subgraph H of G, find a maximal planar Hamilton subgraph of G that contains H, and (3) Given an edge-weighted Hamilton graph G=(V, E), find a planar Hamilton subgraph G
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.
Copy
Noriya KOBAYASHI, Sumio MASUDA, Toshinobu KASHIWABARA, "Algorithms to Obtain a Maximal Planar Hamilton Subgraph" in IEICE TRANSACTIONS on Fundamentals,
vol. E74-A, no. 4, pp. 657-664, April 1991, doi: .
Abstract: In this paper we present polynomial time algorithms for the following three problems on a Hamilton graph with a prescribed Hamilton circuit: (1) Given a Hamilton graph G with a prescribed Hamilton circuit, find a maximal planar Hamilton subgraph of G, (2) Given a Hamilton graph G and a planar Hamilton subgraph H of G, find a maximal planar Hamilton subgraph of G that contains H, and (3) Given an edge-weighted Hamilton graph G=(V, E), find a planar Hamilton subgraph G
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e74-a_4_657/_p
Copy
@ARTICLE{e74-a_4_657,
author={Noriya KOBAYASHI, Sumio MASUDA, Toshinobu KASHIWABARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Algorithms to Obtain a Maximal Planar Hamilton Subgraph},
year={1991},
volume={E74-A},
number={4},
pages={657-664},
abstract={In this paper we present polynomial time algorithms for the following three problems on a Hamilton graph with a prescribed Hamilton circuit: (1) Given a Hamilton graph G with a prescribed Hamilton circuit, find a maximal planar Hamilton subgraph of G, (2) Given a Hamilton graph G and a planar Hamilton subgraph H of G, find a maximal planar Hamilton subgraph of G that contains H, and (3) Given an edge-weighted Hamilton graph G=(V, E), find a planar Hamilton subgraph G
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Algorithms to Obtain a Maximal Planar Hamilton Subgraph
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 657
EP - 664
AU - Noriya KOBAYASHI
AU - Sumio MASUDA
AU - Toshinobu KASHIWABARA
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E74-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1991
AB - In this paper we present polynomial time algorithms for the following three problems on a Hamilton graph with a prescribed Hamilton circuit: (1) Given a Hamilton graph G with a prescribed Hamilton circuit, find a maximal planar Hamilton subgraph of G, (2) Given a Hamilton graph G and a planar Hamilton subgraph H of G, find a maximal planar Hamilton subgraph of G that contains H, and (3) Given an edge-weighted Hamilton graph G=(V, E), find a planar Hamilton subgraph G
ER -