Decomposing a planar graph with girth at least 8 into a forest and a matching

From MaRDI portal
Revision as of 06:52, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:534048

DOI10.1016/J.DISC.2011.01.019zbMath1223.05047OpenAlexW2070483072WikidataQ60060265 ScholiaQ60060265MaRDI QIDQ534048

Qijun Zhang, Ying Qian Wang

Publication date: 10 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.01.019




Related Items (16)




Cites Work




This page was built for publication: Decomposing a planar graph with girth at least 8 into a forest and a matching