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

Paloma Thomé de Lima; Lars Jaffke

doi:10.1016/j.disc.2023.113431

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

Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

Abstract

We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.

Original language	English
Journal	Discrete Mathematics
Volume	346
Issue number	8
ISSN	0012-365X
DOIs	https://doi.org/10.1016/j.disc.2023.113431
Publication status	Published - 2023

Keywords

Planar graphs
Matching number
Extremal problems

Access to Document

10.1016/j.disc.2023.113431

Cite this

@article{af2b400fc7c64bc3acf5d929930fd4f4,

title = "On the maximum number of edges in planar graphs of bounded degree and matching number",

abstract = "We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.",

keywords = "Planar graphs, Matching number, Extremal problems",

author = "{Thom{\'e} de Lima}, Paloma and Lars Jaffke",

year = "2023",

doi = "10.1016/j.disc.2023.113431",

language = "English",

volume = "346",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "8",

}

TY - JOUR

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

AU - Thomé de Lima, Paloma

AU - Jaffke, Lars

PY - 2023

Y1 - 2023

N2 - We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.

AB - We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.

KW - Planar graphs

KW - Matching number

KW - Extremal problems

U2 - 10.1016/j.disc.2023.113431

DO - 10.1016/j.disc.2023.113431

M3 - Journal article

SN - 0012-365X

VL - 346

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 8

ER -

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

Abstract

Keywords

Access to Document

Fingerprint

Cite this