Lower bounds on the cardinality of the maximum matchings of planar graphs
From MaRDI portal
Publication:1135291
DOI10.1016/0012-365X(79)90133-XzbMath0425.05032MaRDI QIDQ1135291
Takao Nishizeki, Ilker Baybars
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)
Related Items (26)
Guarding rectangular art galleries ⋮ Guarding disjoint triangles and claws in the plane ⋮ Edge guards for polyhedra in three-space ⋮ Tight bounds on maximal and maximum matchings ⋮ On the Size of Matchings in 1-Planar Graph with High Minimum Degree ⋮ Protecting convex sets ⋮ An annotated bibliography on 1-planarity ⋮ Improved induced matchings in sparse graphs ⋮ Matchings in 1‐planar graphs with large minimum degree ⋮ Matching for Graphs of Bounded Degree ⋮ A Hall-type theorem with algorithmic consequences in planar graphs ⋮ Tight bound for matching ⋮ Towards optimal kernel for connected vertex cover in planar graphs ⋮ On the maximum matchings of regular multigraphs ⋮ On the obfuscation complexity of planar graphs ⋮ Illuminating labyrinths. ⋮ Complete colorings of planar graphs ⋮ On maximum \(k\)-edge-colorable subgraphs of bipartite graphs ⋮ Improved approximation algorithms for box contact representations ⋮ On disjoint matchings in cubic graphs ⋮ Computing large matchings in planar graphs with fixed minimum degree ⋮ Illumination in the presence of opaque line segments in the plane ⋮ Fixed-orientation equilateral triangle matching of point sets ⋮ On the relationship between the genus and the cardinality of the maximum matchings of a graph ⋮ Improved Induced Matchings in Sparse Graphs ⋮ Bounds on maximum \(b\)-matchings
Cites Work
This page was built for publication: Lower bounds on the cardinality of the maximum matchings of planar graphs
