Results 11 to 20 of about 137,342 (261)
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Electronic Notes in Discrete Mathematics, 2015 Golumbic, Lipshteyn and Stern \cite{Golumbic-epg} proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex of the graph a nontrivial path on a rectangular grid such
Liliana Alcón +6 more
core +7 more sources
Covering edges by cliques with regard to keyword conflicts and intersection graphs [PDF]
Communications of the ACM, 1978 Kellerman has presented a method for determining keyword conflicts and described a heuristic algorithm which solves a certain combinatorial optimization problem in connection with this method. This optimization problem is here shown to be equivalent to the problem of covering the edges of a graph by complete subgraphs with the objective of
Lawrence T. Kou +2 more
exaly +5 more sources
On non-superperfection of edge intersection graphs of paths
Discrete OptimizationzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Victoria Kaial +2 more
exaly +7 more sources
Edge-pancyclic block-intersection graphs
Discrete Mathematics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brian Alspach, Donovan R. Hare
exaly +5 more sources
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid
Journal of Graph Algorithms and Applications, 2022 In a representation of a graph $G$ as an edge intersection graph of paths on a grid (EPG) every vertex of $G$ is represented by a path on a grid and two paths share a grid edge iff the corresponding vertices are adjacent. In a monotonic EPG representation every path on the grid is ascending in both rows and columns.
Eranda Çela, Elisabeth Gaar
openalex +5 more sources
Intersection Graphs in Simultaneous Embedding with Fixed Edges
Journal of Graph Algorithms and Applications, 2009 Summary: We examine the simultaneous embedding with fixed edges problem for two planar graphs \(G_1\) and \(G_2\) with the focus on their intersection \(S=G_1\cap G_2\). In particular, we present the complete set of intersection graphs \(S\) that guarantee a simultaneous embedding with fixed edges for \((G_1,G_2)\). More formally, we define the subset \
Michael Jünger, Michael Schulz
openalex +4 more sources
Edge-Intersection Graphs of k-Bend Paths in Grids [PDF]
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thérèse Biedl, Michal Stern
openalex +4 more sources
Intersection Patterns of Edges in Topological Graphs
, 2012 This thesis is devoted to crossing patterns of edges in topological graphs. We consider the following four problems: A thrackle is a graph drawn in the plane such that every pair of edges meet exactly once: either at a common endpoint or in a proper crossing. Conway's Thrackle Conjecture says that a thrackle cannot have more edges than vertices.
Radoslav Fulek
openalex +3 more sources
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection\n Graph Classes [PDF]
, 2020 For a graph class $\mathcal{C}$, the $\mathcal{C}$-Edge-Deletion problem asks for a given graph $G$ to delete the minimum number of edges from $G$ in order to obtain a graph in $\mathcal{C}$. We study the $\mathcal{C}$-Edge-Deletion problem for $\mathcal{C}$ the permutation graphs, interval graphs, and other related graph classes.
Toshiki Saitoh +2 more
+5 more sources
Bipartite Graphs Whose Edge Algebras Are Complete Intersections [PDF]
Journal of Algebra, 1999 Let R be monomial sub-algebra of $k[x_1,...,x_N]$ generated by square free monomials of degree two. This paper addresses the following question: when is R a complete intersection? For such a k-algebra we can associate a graph G whose vertices are $x_1,...,x_N$ and whose edges are $\{(x_i, x_j) | x_i x_j \in R \}$.
Mordechai Katzman
openalex +5 more sources