Connected Spanning Subgraphs of 3-Connected Planar Graphs

Hikoe Enomoto; Tadashi Iida; Katsuhiro Ota

doi:10.1006/jctb.1996.0072

ScienceGate Book Chapters

JOURNAL ARTICLE

Connected Spanning Subgraphs of 3-Connected Planar Graphs

Hikoe Enomoto Tadashi Iida Katsuhiro Ota

Year: 1996 Journal: Journal of Combinatorial Theory Series B Vol: 68 (2)Pages: 314-323 Publisher: Elsevier BV

DOI: 10.1006/jctb.1996.0072

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Planar graph Outerplanar graph Mathematics Planar straight-line graph Connected component Planar 1-planar graph Strongly connected component Graph Connected dominating set Chordal graph Discrete mathematics Pathwidth Computer science Line graph

Metrics

Cited By

0.49

FWCI (Field Weighted Citation Impact)

Refs

0.60

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Connected Spanning Subgraphs of 3-Connected Planar Graphs

Metrics

Citation History

Topics

Related Documents

2-Connected Spanning Subgraphs of Planar 3-Connected Graphs

On spanning subgraphs of 4-connected planar graphs

Spanning even subgraphs of 3‐edge‐connected graphs

Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs

Highly Connected Graphs Have Highly Connected Spanning Bipartite Subgraphs