2 problems

0 votes0 replies0 views
Sufficiency of the minimal proper-interval completion characterization
Minimal proper-interval completion conjecture. The only-if condition of that theorem is also sufficient. Moreover, if this condition is sufficient, then the problem of finding a mi…
Conjectureopengraph-completion interval-graphs proper-interval-graphsarXiv posted 2 days ago
0 votes0 replies0 views
The conjectured algorithmic complexity for total $k$ -domination of proper interval graphs
A proper interval graph $G$ has an ordering of its vertices by interval endpoints in which the relevant blocks and tuples can be represented as described. For an integer $k>2$ , con…
Conjectureopenalgorithmic-complexity domination proper-interval-graphsarXiv posted 2 days ago

Sufficiency of the minimal proper-interval completion characterization