Results 101 to 110 of about 161 (144)
Improved Outerplanarity Bounds for Planar Graphs
In this paper, we study the outerplanarity of planar graphs, i.e., the number of times that we must (in a planar embedding that we can initially freely choose) remove the outerface vertices until the graph is empty. It is well-known that there are $n$-vertex graphs with outerplanarity $\tfrac{n}{6}+Θ(1)$, and not difficult to show that the ...
Biedl, Therese, Mondal, Debajyoti
openaire +2 more sources
Light graphs in families of outerplanar graphs
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
FOG: Finding outerplanar graphs
, 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. Our system provides several features that allow a user to ask detailed mining questions and visualize the fragments found.
Ramon, Jan +3 more
openaire +1 more source
Reconstruction of maximal outerplanar graphs
Discrete Mathematics, 1972 AbstractS. Ulam has conjectured that every graph with three or more points is uniquely determined by its collection of point-deleted subgraphs. This has been proved for various classes of graphs, but progress has generally been confined to very symmetrical graphs and graphs with connectivity zero or one.
openaire +2 more sources
A note on compact and compact circular edge-colorings of graphs
Discrete Mathematics & Theoretical Computer Science, 2008 In the paper we study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models.
Dariusz Dereniowski, Adam Nadolski
doaj
Matching Complexes of Outerplanar Graphs
An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are contractible or homotopy equivalent to a wedge of spheres.
Bayer, Margaret +2 more
openaire +2 more sources
Structure Properties of Generalized Farey graphs based on Dynamical Systems for Networks. [PDF]
Sci Rep, 2018 Jiang W, Zhai Y, Martin P, Zhao Z.
europepmc +1 more source
Network design for bypass roads using interval valued fuzzy outerplanar graphs. [PDF]
Sci RepJaisankar D +3 more
europepmc +1 more source