Results 91 to 100 of about 414,139 (194)
The product structure of squaregraphs
Journal of Graph Theory, Volume 105, Issue 2, Page 179-191, February 2024.Abstract A squaregraph is a plane graph in which each internal face is a 4‐cycle and each internal vertex has degree at least 4. This paper proves that every squaregraph is isomorphic to a subgraph of the semistrong product of an outerplanar graph and a path.
Robert Hickingbotham +3 more
wiley +1 more source
FOG: Finding outerplanar graphs [PDF]
, 2006 In this demo we will present FOG, a system that mines frequent outerplanar graphs. We argue that outerplanar graphs are an interesting class as they can be mined efficiently and are practically relevant for chemical applications.
Schietgat, Leander +3 more
core
On the Planarity of Generalized Line Graphs
Theory and Applications of Graphs, 2019 One of the most familiar derived graphs is the line graph. The line graph $L(G)$ of a graph $G$ is that graph whose vertices are the edges of $G$ where two vertices of $L(G)$ are adjacent if the corresponding edges are adjacent in~$G$.
Khawlah H. Alhulwah +2 more
doaj +1 more source
Improved Bounds for Track Numbers of Planar Graphs
Journal of Graph Algorithms and Applications, 2020 A track layout of a graph consists of a vertex coloring and a total order of each color class, such that no two edges cross between any two color classes.
Sergey Pupyrev
doaj +1 more source
Nullspace Embeddings for Outerplanar Graphs [PDF]
, 2017 21 pages.
Lovász, L., Schrijver, A.
openaire +6 more sources
k-colored Point-set Embeddability of Outerplanar Graphs
Journal of Graph Algorithms and Applications, 2008 This paper addresses the problem of designing drawing algorithms that receive as input a planar graph G, a partitioning of the vertices of G into k different semantic categories V0,…, Vk−1, and k disjoint sets S0, …, Sk−1 of points in the plane with |Vi|=
Emilio Di Giacomo +5 more
doaj +1 more source
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core
Light graphs in families of outerplanar graphs
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On Colorings of Squares of Outerplanar Graphs
, 2007 24 pages, 17 ...
Geir Agnarsson, Magnús M. Halldórsson
openaire +3 more sources