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 | |
| Publication status | Published - 1996 Nov |
Fingerprint
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 journal › Article
}
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 -