Connected spanning subgraphs of 3-connected planar graphs

Hikoe Enomoto, Tadashi Iida, Ota Katsuhiro

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


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
Issue number2
Publication statusPublished - 1996 Nov

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


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

Cite this