Edge open packing: complexity, algorithmic aspects, and bounds
From MaRDI portal
Publication:6646442
DOI10.1016/J.TCS.2024.114884MaRDI QIDQ6646442
Publication date: 2 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Theory of computing (68Qxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Irredundancy in circular arc graphs
- Approximability results for the maximum and minimum maximal induced matching problems
- Maximum induced matchings for chordal graphs in linear time
- NP-completeness of some generalizations of the maximum matching problem
- Some simplified NP-complete graph problems
- Induced matchings
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- Finding a maximum induced matching in weakly chordal graphs
- On maximum induced matchings in bipartite graphs
- New results on maximum induced matchings in bipartite graphs and beyond
- Complexity and algorithms for injective edge-coloring in graphs
- Note on injective edge-coloring of graphs
- Complexity aspects of the computation of the rank of a graph
- On the Algorithmic Complexity of Total Domination
- Bipartite Domination and Simultaneous Matroid Covers
- Edge open packing sets in graphs
- Total Domination in Categorical Products of Graphs
- Injective edge coloring of graphs
This page was built for publication: Edge open packing: complexity, algorithmic aspects, and bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646442)
