We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that ext...
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
This paper presents new graph-theoretic results appropriate to the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, s...