Irredundancy in circular arc graphs
From MaRDI portal
Publication:686248
DOI10.1016/0166-218X(93)90223-BzbMath0783.05059OpenAlexW1995359535WikidataQ105824569 ScholiaQ105824569MaRDI QIDQ686248
Renu C. Laskar, Martin Charles Golumbic
Publication date: 13 March 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)90223-b
Related Items (50)
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 ⋮ Almost Induced Matching: Linear Kernels and Parameterized Algorithms ⋮ Unnamed Item ⋮ Exact algorithms for maximum induced matching ⋮ On the parameterized complexity of the acyclic matching problem ⋮ Unnamed Item ⋮ Induced matchings in asteroidal triple-free graphs ⋮ Parameterized algorithms and kernels for almost induced matching ⋮ A min-max property of chordal bipartite graphs with applications ⋮ Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem ⋮ Induced matchings in intersection graphs. ⋮ Well-indumatched Trees and Graphs of Bounded Girth ⋮ New results on induced matchings ⋮ Approximability results for the maximum and minimum maximal induced matching problems ⋮ Generalizing the induced matching by edge capacity constraints ⋮ Maximum induced matching algorithms via vertex ordering characterizations ⋮ Approximating weighted induced matchings ⋮ A note on graphs which have upper irredundance equal to independence ⋮ Induced Matchings in Graphs of Degree at Most 4 ⋮ A lower bound for the CO-irredundance number of a graph ⋮ On the approximability of the maximum induced matching problem ⋮ On distance-3 matchings and induced matchings ⋮ On the complexity of the dominating induced matching problem in hereditary classes of graphs ⋮ Generalized subgraph-restricted matchings in graphs ⋮ The complexity of dissociation set problems in graphs ⋮ Maximum induced matching of hexagonal graphs ⋮ The induced matching and chain subgraph cover problems for convex bipartite graphs ⋮ New kernels for several problems on planar graphs ⋮ Some bounds on the maximum induced matching numbers of certain grids ⋮ Irredundance ⋮ The Private Neighbor Concept ⋮ Finding a maximum induced matching in weakly chordal graphs ⋮ Maximum induced matchings for chordal graphs in linear time ⋮ The parameterized complexity of the induced matching problem ⋮ Some results on graphs without long induced paths ⋮ Maximum induced matching problem on hhd-free graphs ⋮ On Distance-3 Matchings and Induced Matchings ⋮ Recent progress on strong edge-coloring of graphs ⋮ Brambles and independent packings in chordal graphs ⋮ The graphs with maximum induced matching and maximum matching the same size ⋮ Upper domination and upper irredundance perfect graphs ⋮ On maximum induced matchings in bipartite graphs ⋮ Independent packings in structured graphs ⋮ Weighted irredundance of interval graphs. ⋮ Squares of Intersection Graphs and Induced Matchings ⋮ Maximum Induced Matching Algorithms via Vertex Ordering Characterizations ⋮ On the computational complexity of strong edge coloring ⋮ Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs ⋮ Maximum induced matchings of random cubic graphs
Cites Work
- The irredundance number and maximum degree of a graph
- Contributions to the theory of domination, independence and irredundance in graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Stability, domination and irredundance in a graph
- Total Domination and Irredundance in Weighted Interval Graphs
- Stability in circular arc graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Irredundancy in circular arc graphs
