Decomposing a planar graph of girth 5 into an independent set and a forest

DOI10.1016/j.jctb.2008.11.002zbMath1184.05029WikidataQ56926606 ScholiaQ56926606MaRDI QIDQ1026008

Ken-ichi Kawarabayashi, Carsten Thomassen

Publication date: 23 June 2009

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2008.11.002

zbMATH Keywords

independent sets; forests; planar graphs of girth 5

Mathematics Subject Classification ID

05C05: Trees

05C10: Planar graphs; geometric and topological aspects of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)