Connected spanning subgraphs of 3-connected planar graphs

Hikoe Enomoto, Tadashi Iida, Katsuhiro Ota

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We prove that every 3-connected planar graph whose minimum degree is greater than or equal to 4 has a connected [2, 3]-factor.

Original languageEnglish
Pages (from-to)314-323
Number of pages10
JournalJournal of Combinatorial Theory. Series B
Volume68
Issue number2
DOIs
Publication statusPublished - 1996 Nov

Fingerprint

Spanning Subgraph
Minimum Degree
Planar graph
Connected graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Connected spanning subgraphs of 3-connected planar graphs. / Enomoto, Hikoe; Iida, Tadashi; Ota, Katsuhiro.

In: Journal of Combinatorial Theory. Series B, Vol. 68, No. 2, 11.1996, p. 314-323.

Research output: Contribution to journalArticle

Enomoto, Hikoe ; Iida, Tadashi ; Ota, Katsuhiro. / Connected spanning subgraphs of 3-connected planar graphs. In: Journal of Combinatorial Theory. Series B. 1996 ; Vol. 68, No. 2. pp. 314-323.
@article{c8cd6508167f4a9d8b492e7728bba1a9,
title = "Connected spanning subgraphs of 3-connected planar graphs",
abstract = "We prove that every 3-connected planar graph whose minimum degree is greater than or equal to 4 has a connected [2, 3]-factor.",
author = "Hikoe Enomoto and Tadashi Iida and Katsuhiro Ota",
year = "1996",
month = "11",
doi = "10.1006/jctb.1996.0072",
language = "English",
volume = "68",
pages = "314--323",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Connected spanning subgraphs of 3-connected planar graphs

AU - Enomoto, Hikoe

AU - Iida, Tadashi

AU - Ota, Katsuhiro

PY - 1996/11

Y1 - 1996/11

N2 - We prove that every 3-connected planar graph whose minimum degree is greater than or equal to 4 has a connected [2, 3]-factor.

AB - We prove that every 3-connected planar graph whose minimum degree is greater than or equal to 4 has a connected [2, 3]-factor.

UR - http://www.scopus.com/inward/record.url?scp=0030295237&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030295237&partnerID=8YFLogxK

U2 - 10.1006/jctb.1996.0072

DO - 10.1006/jctb.1996.0072

M3 - Article

AN - SCOPUS:0030295237

VL - 68

SP - 314

EP - 323

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 2

ER -