In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
Min Chih Lin, Dieter Rautenbach, Francisco J. Soul...
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...