Finding large matchings in 1-planar graphs of minimum degree 3
From MaRDI portal
Publication:2110625
DOI10.1007/978-3-030-60440-0_20OpenAlexW3096348085MaRDI QIDQ2110625
Fabian Klute, Therese C. Biedl
Publication date: 21 December 2022
Full work available at URL: https://arxiv.org/abs/2002.11818
Related Items (2)
On the Size of Matchings in 1-Planar Graph with High Minimum Degree ⋮ Matchings in 1‐planar graphs with large minimum degree
This page was built for publication: Finding large matchings in 1-planar graphs of minimum degree 3
