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

DOI10.1016/j.disc.2023.113431zbMath1515.05092arXiv2207.03130MaRDI QIDQ6041557

Paloma T. Lima, Lars Jaffke

Publication date: 31 May 2023

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

Full work available at URL: https://arxiv.org/abs/2207.03130

zbMATH Keywords

planar graphsextremal problemsmatching number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
• Graphs with restricted valency and matching number
• Degrees and matchings
• Planar graphs of maximum degree seven are Class I
• On the chromatic index of outerplanar graphs
• Extremal \(H\)-free planar graphs
• The maximum number of paths of length four in a planar graph
• Generalized planar Turán numbers
• ExtremalC₄-Free/C₅-Free Planar Graphs
• On the number of hamiltonian cycles in a maximal planar graph
• The NP-Completeness of Edge-Coloring
• On Planar Graphical Degree Sequences
• On the maximum number of cycles in a planar graph
• On the maximum number of edges in chordal graphs of bounded degree and matching number

This page was built for publication: On the maximum number of edges in planar graphs of bounded degree and matching number