Recommendations
- Irredundance graphs
- Total irredundance in graphs
- Partial characterizations of circular-arc graphs
- Partial Characterizations of Circular-Arc Graphs
- Circularity of planar graphs
- Irredundance in inflated graphs
- Independent Sets in Circular-Arc Graphs
- Circumdetic graphs
- Irredundance perfect graphs
- Circular‐arc digraphs: A characterization
Cites work
- scientific article; zbMATH DE number 3859049 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3869363 (Why is no real title available?)
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 4055676 (Why is no real title available?)
- scientific article; zbMATH DE number 4101267 (Why is no real title available?)
- scientific article; zbMATH DE number 3477211 (Why is no real title available?)
- Chordal graphs and upper irredundance, upper domination and independence
- Contributions to the theory of domination, independence and irredundance in graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Properties of Hereditary Hypergraphs and Middle Graphs
- Stability in circular arc graphs
- Stability, domination and irredundance in a graph
- The irredundance number and maximum degree of a graph
- Total Domination and Irredundance in Weighted Interval Graphs
Cited in
(55)- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
- The graphs with maximum induced matching and maximum matching the same size
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
- Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
- Weighted irredundance of interval graphs.
- Upper domination and upper irredundance perfect graphs
- Some bounds on the maximum induced matching numbers of certain grids
- Independent packings in structured graphs
- A bisection approach to subcubic maximum induced matching
- Approximating weighted induced matchings
- A lower bound for the CO-irredundance number of a graph
- Almost induced matching: linear kernels and parameterized algorithms
- Maximum induced matchings of random cubic graphs
- The complexity of dissociation set problems in graphs
- A note on graphs which have upper irredundance equal to independence
- Generalized subgraph-restricted matchings in graphs
- Maximum induced matching of hexagonal graphs
- Parameterized algorithms and kernels for almost induced matching
- Maximum induced matching problem on hhd-free graphs
- Induced matchings in graphs of degree at most 4
- On the computational complexity of strong edge coloring
- Some results on graphs without long induced paths
- Exact algorithms for maximum induced matching
- The private neighbor concept
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- A min-max property of chordal bipartite graphs with applications
- On the parameterized complexity of the acyclic matching problem
- A linear algorithm for computing of a minimum weight maximal induced matching in an edge-weighted tree
- Generalizing the induced matching by edge capacity constraints
- On the complexity of the dominating induced matching problem in hereditary classes of graphs
- On maximum induced matchings in bipartite graphs
- Circular discernment in completely extensive structures and how to avoid such circles generally
- Induced matchings in asteroidal triple-free graphs
- Brambles and independent packings in chordal graphs
- The parameterized complexity of the induced matching problem
- On distance-3 matchings and induced matchings
- An improved kernel and parameterized algorithm for almost induced matching
- New kernels for several problems on planar graphs
- Edge open packing: complexity, algorithmic aspects, and bounds
- Maximum induced matching algorithms via vertex ordering characterizations
- Squares of Intersection Graphs and Induced Matchings
- On distance-3 matchings and induced matchings
- Maximum induced matching algorithms via vertex ordering characterizations
- Well-indumatched pseudoforests
- Approximability results for the maximum and minimum maximal induced matching problems
- The induced matching and chain subgraph cover problems for convex bipartite graphs
- Maximum induced matchings for chordal graphs in linear time
- Irredundance
- Recent progress on strong edge-coloring of graphs
- On the approximability of the maximum induced matching problem
- Induced matchings in intersection graphs.
- New results on induced matchings
- Well-indumatched Trees and Graphs of Bounded Girth
- Finding a maximum induced matching in weakly chordal graphs
This page was built for publication: Irredundancy in circular arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686248)
