Decomposing a planar graph with girth 9 into a forest and a matching

Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu

Research output: Contribution to journalArticle

Abstract

W. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a matching. D. Kleitman et al. proved the same statement for planar graphs of girth 10. We further improve the bound on girth to 9.

Original languageEnglish (US)
Pages (from-to)1235-1241
Number of pages7
JournalEuropean Journal of Combinatorics
Volume29
Issue number5
DOIs
StatePublished - Jul 1 2008

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Decomposing a planar graph with girth 9 into a forest and a matching'. Together they form a unique fingerprint.

  • Cite this