We prove that every 3-connected planar graph whose minimum degree is greater than or equal to 4 has a connected [2, 3]-factor.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Enomoto, H., Iida, T., & Katsuhiro, O. (1996). Connected spanning subgraphs of 3-connected planar graphs. Journal of Combinatorial Theory. Series B, 68(2), 314-323. https://doi.org/10.1006/jctb.1996.0072