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 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics