scientific article; zbMATH DE number 4152428
From MaRDI portal
Publication:3481747
Recommendations
Cited in
(42)- A linear time recognition algorithm for proper interval graphs
- Construction of a simple elimination scheme for a chordal comparability graph in linear time
- New linear time algorithms for generating perfect elimination orderings of chordal graphs
- LexBFS-orderings and powers of chordal graphs
- Perfect elimination orderings of chordal powers of graphs
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Double vertex-edge domination in graphs: complexity and algorithms
- Double-threshold permutation graphs
- Exact square coloring of certain classes of graphs: complexity and algorithms
- Perfect elimination orderings for symmetric matrices
- Algorithm and hardness results on neighborhood total domination in graphs
- Algorithmic aspects of upper paired-domination in graphs
- Algorithmic results on double Roman domination in graphs
- Perfect Roman domination in graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- A linear time algorithm for liar's domination problem in proper interval graphs
- Oracles for vertex elimination orderings
- Injective coloring of some subclasses of bipartite graphs and chordal graphs
- On some simplicial elimination schemes for chordal graphs
- How vertex elimination can overachieve
- Algorithmic aspects of disjunctive domination in graphs
- Vertex orderings of graphs: an overview
- Elimination Graphs
- scientific article; zbMATH DE number 1282792 (Why is no real title available?)
- scientific article; zbMATH DE number 1107728 (Why is no real title available?)
- scientific article; zbMATH DE number 1145349 (Why is no real title available?)
- Finding outer-connected dominating sets in interval graphs
- Acyclic Matching in Some Subclasses of Graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- The strong domination problem in block graphs and proper interval graphs
- On the complexity of minimum maximal uniquely restricted matching
- Unique response Roman domination: complexity and algorithms
- Minimum maximal acyclic matching in proper interval graphs
- On domination elimination orderings and domination graphs
- Algorithms and hardness results for edge total domination problem in graphs
- Minimum maximal acyclic matching in proper interval graphs
- Algorithmic aspects of \(b\)-disjunctive domination in graphs
- Algorithmic results on independent Roman \(\{2\}\)-domination
- Some aspects of perfect elimination orderings in chordal graphs
- Minimal proper interval completions
- A characterization of signed graphs with generalized perfect elimination orderings
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3481747)
