On the König deficiency of zero-reducible graphs
DOI10.1007/S10878-019-00466-2zbMATH Open1434.05119OpenAlexW2987505511MaRDI QIDQ2292142FDOQ2292142
Publication date: 3 February 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00466-2
Recommendations
- On reduced zero-divisor graphs of posets
- Publication:5750892
- On Realizing Zero-Divisor Graphs
- Grundy domination and zero forcing in Kneser graphs
- Reduced zero-divisor graphs of posets
- On zero divisor graphs
- Irredundance and domination in kings graphs
- On domination in zero-divisor graphs
- On deficiency problems for graphs
- On \(\alpha^{+}\)-stable König-Egerváry graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Matching theory
- Paths, Trees, and Flowers
- Efficiency of a Good But Not Linear Set Union Algorithm
- A linear-time algorithm for a special case of disjoint set union
- Tutte type theorems for graphs having a perfect internal matching
- Graphs with equal independence and annihilation numbers
- Title not available (Why is that?)
- Critical independent sets and König-Egerváry graphs
- Unique maximum matching algorithms
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs
- Deterministic soliton graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Near-optimal fully-dynamic graph connectivity
- Title not available (Why is that?)
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
Cited In (1)
This page was built for publication: On the König deficiency of zero-reducible graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292142)
