Given an arbitrary graph and a proper interval graph with we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich graph with , is not a ...

Graphs with bounded thinness were defined in 2007 as a generalization of interval graphs. In this paper we introduce the concept of proper thinness, such that graphs with bounded proper thinness generalize proper interval ...

Given an arbitrary graph G = (V,E) and a proper interval graph H = (V,F) with E ⊆ F we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich ...

Given an arbitrary graph G=(V,E) and a proper interval graph H=(V,F) with E ⊆ F we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich ...

In 1969, Tucker characterized proper circular-arc graphs as those graphs whose augmented adjacency matrices have the circularly compatible ones property. Moreover, he also found a polynomial-time algorithm for deciding ...

© 2018 American Physical Society. A new definition of proper time, which may incorporate all of the fundamental interactions as well as the whole Poincaré group, is presented. The new proper time definition reduces to the ...

Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set, also known as a k-tuple total dominating ...

Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set is a set of vertices such that every ...