Connected spanning subgraphs of 3-connected planar graphs

Hikoe Enomoto; Tadashi Iida; Ota Katsuhiro

doi:10.1006/jctb.1996.0072

Connected spanning subgraphs of 3-connected planar graphs

Hikoe Enomoto, Tadashi Iida, Ota Katsuhiro

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	314-323
Number of pages	10
Journal	Journal of Combinatorial Theory. Series B
Volume	68
Issue number	2
DOIs	https://doi.org/10.1006/jctb.1996.0072
Publication status	Published - 1996 Nov

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1006/jctb.1996.0072

Fingerprint Dive into the research topics of 'Connected spanning subgraphs of 3-connected planar graphs'. Together they form a unique fingerprint.

Cite this

@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 Ota Katsuhiro",

year = "1996",

month = nov,

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 - Katsuhiro, Ota

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 -