New results relating independence and matchings
From MaRDI portal
Publication:2151222
DOI10.7151/dmgt.2317zbMath1492.05112arXiv1909.09093OpenAlexW3019608685MaRDI QIDQ2151222
Yair Caro, Randy Davila, Ryan Pepper
Publication date: 1 July 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.09093
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)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The critical independence number and an independence decomposition
- Graphs with equal independence and annihilation numbers
- A characterization of well covered graphs of girth 5 or greater
- On edge domination numbers of graphs
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- On the number of vertices belonging to all maximum stable sets of a graph
- On \(\alpha^{+}\)-stable König-Egerváry graphs
- Independent domination in graphs: A survey and recent results
- Forbidden subgraphs and the König-Egerváry property
- On maximum matchings in König-Egerváry graphs
- Minimum node covers and 2-bicritical graphs
- On independent sets in random graphs
- Vertex packings: Structural properties and algorithms
- On the integer-valued variables in the linear vertex packing problem
- WELL-COVERED GRAPHS: A SURVEY
- On König-Egerváry collections of maximum critical independent sets
- Sparse graphs: Metrics and random models
This page was built for publication: New results relating independence and matchings
