نتایج جستجو برای: subgroup intersection graph

تعداد نتایج: 306044  

Journal: :AKCE International Journal of Graphs and Combinatorics 2019

Journal: :Discrete Mathematics 1985
Martin Charles Golumbic

Interval graphs have engaged the interest of researchers for over twenty-five years. The scope of current research in this area now extends to the mathematical and algorithmic properties of interval graphs, their generalizations, and graph parameters motivated by them. One main reason for this increasing interest is that many real-world applications involve solving problems on graphs which are ...

Journal: :J. Graph Algorithms Appl. 2010
Cornelia Dangelmayr Stefan Felsner William T. Trotter

We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that can be represented as intersection graph of subpaths on a tree are pseudosegment intersection graphs. We then study the limits of representability. We describe a family of intersection graphs of substars of a star which ...

Journal: :CoRR 2012
Luciano N. Grippo Martín Darío Safe

An interval graph is the intersection graph of a finite set of intervals on a line and a circular-arc graph is the intersection graph of a finite set of arcs on a circle. While a forbidden induced subgraph characterization of interval graphs was found fifty years ago, finding an analogous characterization for circular-arc graphs is a long-standing open problem. In this work, we study the inters...

Journal: :Networks 2007
Martin Charles Golumbic Marina Lipshteyn Michal Stern

We combine the known notion of the edge intersection graphs of paths in a tree with a VLSI grid layout model to introduce the edge intersection graphs of paths on a grid. Let P be a collection of nontrivial simple paths on a grid G. We define the edge intersection graph EPG(P) of P to have vertices which correspond to the members of P, such that two vertices are adjacent in EPG(P) if the corres...

Journal: :Electronic Journal of Graph Theory and Applications 2018

Journal: :Eur. J. Comb. 2001
James Barker Coykendall IV J. Dover

Using a Singer cycle in Desarguesian planes of order q ≡ 1 (mod 3), q a prime power, Brouwer [2] gave a construction of sets such that every line of the plane meets them in one of three possible intersection sizes. These intersection sizes x, y, and z satisfy the system of equations

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید