Minimum maximal matchings in cubic graphs
From MaRDI portal
Publication:2144321
DOI10.37236/9963zbMath1497.05213arXiv2008.01863OpenAlexW3047592838WikidataQ114023827 ScholiaQ114023827MaRDI QIDQ2144321
Publication date: 13 June 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.01863
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
- On domination and independent domination numbers of a graph
- Approximating edge dominating set in dense graphs
- Improved approximation bounds for edge dominating set in dense graphs
- Minimum-maximal matching in series-parallel graphs
- On independent domination number of regular graphs
- Independent domination in graphs: A survey and recent results
- Bounding and approximating minimum maximal matchings in regular graphs
- Jones' conjecture in subcubic graphs
- Approximation hardness of edge dominating set problems
- A new bound on the domination number of connected cubic graphs
- Hardness and approximation of minimum maximal matchings
- Squared Chromatic Number Without Claws or Large Cliques
- Minimum Edge Dominating Sets
- On Domination Number of 4-Regular Graphs
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
- Edge Dominating Sets in Graphs
- Paths, Stars and the Number Three
- Induced Matchings in Subcubic Graphs
- Large independent sets in triangle-free cubic graphs: beyond planarity
- Computing and Combinatorics
- SOFSEM 2006: Theory and Practice of Computer Science
This page was built for publication: Minimum maximal matchings in cubic graphs
