Pages that link to "Item:Q1135291"
From MaRDI portal
The following pages link to Lower bounds on the cardinality of the maximum matchings of planar graphs (Q1135291):
Displaying 29 items.
- Tight bound for matching (Q431927) (← links)
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- Fixed-orientation equilateral triangle matching of point sets (Q744055) (← links)
- On the relationship between the genus and the cardinality of the maximum matchings of a graph (Q755593) (← links)
- On the obfuscation complexity of planar graphs (Q924163) (← links)
- On disjoint matchings in cubic graphs (Q968438) (← links)
- Bounds on maximum \(b\)-matchings (Q1043589) (← links)
- On the maximum matchings of regular multigraphs (Q1155632) (← links)
- Guarding rectangular art galleries (Q1326753) (← links)
- Protecting convex sets (Q1343224) (← links)
- Illuminating labyrinths. (Q1428567) (← links)
- Complete colorings of planar graphs (Q1727729) (← links)
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs (Q1730239) (← links)
- Guarding disjoint triangles and claws in the plane (Q1873155) (← links)
- Tight bounds on maximal and maximum matchings (Q1877645) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- Edge guards for polyhedra in three-space (Q2123291) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Matching for Graphs of Bounded Degree (Q3507330) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)
- On the Size of Matchings in 1-Planar Graph with High Minimum Degree (Q5046627) (← links)
- Illumination in the presence of opaque line segments in the plane (Q5959562) (← links)
- Matchings in 1‐planar graphs with large minimum degree (Q6056806) (← links)
- A Hall-type theorem with algorithmic consequences in planar graphs (Q6197750) (← links)
- Graphs, disjoint matchings and some inequalities (Q6615584) (← links)
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability (Q6616225) (← links)
- Large matchings in maximal 1-planar graphs (Q6646410) (← links)