Well-indumatched Trees and Graphs of Bounded Girth
From MaRDI portal
Publication:5060441
zbMath1506.05165arXiv1903.03197MaRDI QIDQ5060441
Saieed Akbari, Amir Hossein Ghodrati, Sanaz Zare, Tınaz Ekim
Publication date: 10 January 2023
Full work available at URL: https://arxiv.org/abs/1903.03197
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with maximal induced matchings of the same size
- On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7
- Progress in commutative algebra 1. Combinatorics and homology
- Irredundancy in circular arc graphs
- Dominating sets for split and bipartite graphs
- Approximability results for the maximum and minimum maximal induced matching problems
- Maximum induced matchings for chordal graphs in linear time
- Clustering and domination in perfect graphs
- Problems and results in combinatorial analysis and graph theory
- NP-completeness of some generalizations of the maximum matching problem
- Induced matchings
- A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
- On two extensions of equimatchable graphs
- 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
- On the approximability of the maximum induced matching problem
- New results on maximum induced matchings in bipartite graphs and beyond
- New results on induced matchings
- A characterization of well-indumatchable graphs having girth greater than seven
- Efficient recognition of equimatchable graphs
- Strong edge-colouring and induced matchings
- Well-totally-dominated graphs
- A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
- On graphs with polynomially solvable maximum-weight clique problem
- WELL-COVERED GRAPHS: A SURVEY
- Bipartite Domination and Simultaneous Matroid Covers
- On Almost Well-Covered Graphs of Girth at Least 6
- Recognizing Greedy Structures
- Well covered simplicial, chordal, and circular arc graphs
This page was built for publication: Well-indumatched Trees and Graphs of Bounded Girth
