The 2-Tuple Domination Problem on Circular-Arc Graphs

Journal of Mathematics and Informatics
doi 10.22457/jmi.v8a6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

House of Scientific Research

Related search

A Simple Linear Algorithm for the Connected Domination Problem in Circular-Arc Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2004English

3-Tuple Domination Number in Complete Grid Graphs

International Mathematical Forum
2006English

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

On the 2-Domination Number of Complete Grid Graphs

Open Journal of Discrete Mathematics
2017English

Total Roman {;2}-Domination in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

A Polynomial-Time Algorithm for the Paired-Domination Problem on Permutation Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Fully Dynamic Recognition of Proper Circular-Arc Graphs

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2013English

On Exponential Domination of Graphs

English

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy