منابع مشابه
Chordal graphs, interval graphs, and wqo
Let ! be the induced-minor relation. It is shown that, for every t, all chordal graphs of clique number at most t are well-quasi-ordered by !. On the other hand, if the bound on clique number is dropped, even the class of interval graphs is not well-quasi-ordered by !. c © 1998 John Wiley & Sons, Inc. J Graph Theory 28: 105–114, 1998
متن کاملEdge searching weighted graphs
In traditional edge searching one tries to clean all of the edges in a graph employing the least number of searchers. It is assumed that each edge of the graph initially has a weight equal to one. In this paper we modify the problem and introduce the Weighted Edge Searching Problem by considering graphswith arbitrary positive integerweights assigned to its edges. We give bounds on the weighted ...
متن کاملGraph Searching & Perfect Graphs ∗
Perfect graphs, by definition, have a nice structure, that graph searching seems to extract in a, often non-inexpensive, manner. We scratch the surface of this elegant research area by giving two examples: Lexicographic Breadth Search on Chordal Graphs, and Lexicographic Depth First Search on Cocomparability graphs.
متن کاملSearching Cycle-Disjoint Graphs
In this paper, we consider the edge searching problem on cycle-disjoint graphs. We first improve the running time of the algorithm to compute the vertex separation and the optimal layout of a unicyclic graph, which is given by Ellis et al. (2004), from O(n log n) to O(n). By a linear-time transformation, we can compute the edge search number of a unicyclic graph in linear time. We also propose ...
متن کاملSearching isomorphic graphs
To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs are isomorphic, in each of them we can find such positionally equivalent auxiliary digraphs that have the same mutual positioning of vertices. Obviously, if...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00297-4