scientific article
From MaRDI portal
Publication:3481747
zbMath0703.05049MaRDI QIDQ3481747
Robert E. Jamison, Renu C. Laskar
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Acyclic Matching in Some Subclasses of Graphs ⋮ Double-threshold permutation graphs ⋮ Algorithmic Aspects of Disjunctive Domination in Graphs ⋮ Injective coloring of some subclasses of bipartite graphs and chordal graphs ⋮ Exact square coloring of certain classes of graphs: complexity and algorithms ⋮ Unique response Roman domination: complexity and algorithms ⋮ Minimum maximal acyclic matching in proper interval graphs ⋮ Algorithms and hardness results for edge total domination problem in graphs ⋮ Algorithm and hardness results on neighborhood total 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 ⋮ Finding outer-connected dominating sets in interval graphs ⋮ Minimal proper interval completions ⋮ On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs ⋮ A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs ⋮ Algorithmic aspects of \(b\)-disjunctive domination in graphs ⋮ Algorithmic aspects of upper paired-domination in graphs ⋮ The strong domination problem in block graphs and proper interval graphs ⋮ On the complexity of minimum maximal uniquely restricted matching ⋮ Algorithmic results on double Roman domination in graphs ⋮ A linear time recognition algorithm for proper interval graphs ⋮ Double vertex-edge domination in graphs: complexity and algorithms ⋮ Perfect Roman domination in graphs
This page was built for publication:
