On the maximum number of edges in planar graphs of bounded degree and matching number

dc.contributor.author	Jaffke, Lars
dc.contributor.author	Lima, Paloma T.
dc.date.accessioned	2023-08-28T12:26:24Z
dc.date.available	2023-08-28T12:26:24Z
dc.date.created	2023-06-28T09:39:06Z
dc.date.issued	2023
dc.identifier.issn	0012-365X
dc.identifier.uri	https://hdl.handle.net/11250/3086019
dc.description.abstract	We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.	en_US
dc.language.iso	eng	en_US
dc.publisher	Elsevier	en_US
dc.rights	Navngivelse 4.0 Internasjonal	*
dc.rights.uri	http://creativecommons.org/licenses/by/4.0/deed.no	*
dc.title	On the maximum number of edges in planar graphs of bounded degree and matching number	en_US
dc.type	Journal article	en_US
dc.type	Peer reviewed	en_US
dc.description.version	publishedVersion	en_US
dc.rights.holder	Copyright 2023 The Author(s)	en_US
dc.source.articlenumber	113431	en_US
cristin.ispublished	true
cristin.fulltext	original
cristin.qualitycode	1
dc.identifier.doi	10.1016/j.disc.2023.113431
dc.identifier.cristin	2158918
dc.source.journal	Discrete Mathematics	en_US
dc.identifier.citation	Discrete Mathematics. 2023, 346 (8), 113431.	en_US
dc.source.volume	346	en_US
dc.source.issue	8	en_US

Except where otherwise noted, this item's license is described as Navngivelse 4.0 Internasjonal