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

DOI10.1016/J.DISC.2023.113431MaRDI QIDQ6041557zbMATH OpenFDO

Authors Lars Jaffke, Paloma T. Lima

Publication date 31 May 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

extremal problemsmatching numberplanar graphs

Mathematics Subject Classification ID

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

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

Cites work

• Degrees and matchings
• Extremal \(C_{4}\)-free/\(C_{5}\)-free planar graphs
• Extremal \(H\)-free planar graphs
• Generalized planar Turán numbers
• Graphs with restricted valency and matching number
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
• On Planar Graphical Degree Sequences
• On the chromatic index of outerplanar graphs
• 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
• On the number of hamiltonian cycles in a maximal planar graph
• Planar graphs of maximum degree seven are Class I
• The maximum number of paths of length four in a planar graph
• The NP-Completeness of Edge-Coloring

Cited in

(3)

• On the Size of Matchings in 1-Planar Graph with High Minimum Degree
• On the maximum number of edges in chordal graphs of bounded degree and matching number
• Maximum size of connected graphs with bounded maximum 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041557)