T.A. McKee and F.R. McMorris. Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Bound Graph Polysemy - Paul J. Tanenbaum (2000) (Correct)
....bound graph as any graph whose vertices may be partially ordered in such a way that distinct vertices have an upper bound if and only if they are adjacent. This class of graphs has been studied widely [1, 2, 3, 4, 8] since its introduction. An excellent current survey of the field may be found in [7]. It is straightforward to see that the lower bound graphs, defined analogously, constitute precisely the same class. In general, a poset realizes two graphs simultaneously: one is its upper bound graph and another, its lower bound graph. These graphs may be thought of as two meanings of the ....
T. A. McKee and F. R. McMorris, Topics in intersection graph theory, SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, Philadlphia, 1999.
Neighborhood Expansion Grammars - Pfaltz (1999) (Correct)
....to be only K 1 , i.e. a single point, then G generates all, and only, undirected trees. These two grammars clearly illustrate the essential tree like structure of chordal graphs. This latter result is well known, since every chordal graph is the intersection graph of the subtrees of a tree [7, 14]. 1.2 Neighborhoods We say j is a complete neighborhood operator if for all X U, X X:j, X Y implies X:j Y:j, X [ Y ) j = X:j [ Y:j, X Y ) j = X:j Y:j. possibly unnecessary) Clearly, a neighborhood operator expands the subset. We are often more interested in the deleted ....
....above. 2 Conjecture 3.3 Let F be a family of discrete undirected systems G. If there exists a neighborhood operator j and a compatible closure operator in which every singleton is closed, then G is essentially tree like. For tree like , we expect a definition based on intersection graphs [14]. In [19] three different closure operators are defined over partially ordered systems. They are Y: L = fxj9y 2 Y; x yg, Y: R = fzj9y 2 Y; y zg, Y: C = fxj9y 1 ; y 2 2 Y; y 1 x y 2 g. On partially ordered systems, L , and R are ideal closure operators, C is an interval, or ....
Terry A. McKee and Fred R. McMorris. Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Math., Philadelphia, PA, 1999.
Two Tricks to Triangulate Chordal Probe Graphs in.. - Berry, Golumbic, Lipshteyn (2004) (Correct)
No context found.
T.A. McKee and F.R. McMorris. Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999.
Recognizing and Triangulating Chordal Probe Graphs - Berry, Golumbic, Lipshteyn (2003) (Correct)
No context found.
T.A. McKee and F.R. McMorris. Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999.
Simple Max-Cut for Split-Indifference Graphs and.. - Bodlaender, de.. (Correct)
No context found.
T. A. McKee and F. R. Morris. Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1999
Global Constraints as Graph Properties on Structured Network of .. - Beldiceanu (2000) (24 citations) (Correct)
No context found.
T. A. McKee and F. R. McMorris. Topics in Intersection Graph Theory. Siam Monographs on Discrete Mathematics and Applications, (February 1999).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC