Abstract

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

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title
Journal
Date
Author
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
Pinar Heggernes ... Tınaz Ekim
Discrete Mathematics | VOL. 340
Pinar Heggernes, et. al.Pinar Heggernes ... Tınaz Ekim
06 Feb 2017
A characterization of graphs with given maximum degree and smallest possible matching number: II
Michael A Henning ... Zekhaya B Shozi
Discrete Mathematics | VOL. 345
Michael A Henning, et. al.Michael A Henning ... Zekhaya B Shozi
06 Dec 2021
Constructing extremal triangle-free graphs using integer programming
Tınaz Ekim ... Ali Erdem Banak
Discrete Optimization | VOL. 50
Tınaz Ekim, et. al.Tınaz Ekim ... Ali Erdem Banak
05 Sep 2023
2-subcoloring is NP-complete for planar comparability graphs
Pascal Ochem
Information Processing Letters | VOL. 128
Pascal OchemPascal Ochem
30 Aug 2017
View more papers

More From: Discrete Mathematics

Paper Title
Journal
Date
Author
Transversal numbers of stacked spheres
Minho Cho ... Jinha Kim
Discrete Mathematics | VOL. 347
Minho Cho, et. al.Minho Cho ... Jinha Kim
08 May 2024
New qubit codes from multidimensional circulant graphs
Padmapani Seneviratne ... Adrian Thananopavarn
Discrete Mathematics | VOL. 347
Padmapani Seneviratne, et. al.Padmapani Seneviratne ... Adrian Thananopavarn
03 May 2024
Gallai's conjecture for 3-degenerated graphs
Junhao Zhang ... Yanmei Hong
Discrete Mathematics | VOL. 347
Junhao Zhang, et. al.Junhao Zhang ... Yanmei Hong
03 May 2024
The maximum size of an induced forest in the binomial random graph
Margarita Akhmejanova ... Vladislav Kozhevnikov
Discrete Mathematics | VOL. 347
Margarita Akhmejanova, et. al.Margarita Akhmejanova ... Vladislav Kozhevnikov
03 May 2024
View more papers