Results 111 to 120 of about 886,125 (210)
Unsplittable Multicommodity Flows in Outerplanar Graphs
Full version of IPCO 2025 ...
David Alemán-Espinosa, Nikhil Kumar
openaire +2 more sources
Horizontal visibility graph of a random restricted growth sequence. [PDF]
Adv Appl Math, 2021 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs
Discussiones Mathematicae Graph Theory, 2015 Given graphs G and H, a vertex coloring c : V (G) →ℕ is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ (H,G), is the minimum number of colors in an H-free coloring of G.
Kubicka Ewa +2 more
doaj +1 more source
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
A study of upper ideal relation graphs of rings
AKCE International Journal of Graphs and CombinatoricsLet R be a ring with unity. The upper ideal relation graph [Formula: see text] of the ring R is the simple undirected graph whose vertex set is the set of all non-unit elements of R and two distinct vertices x, y are adjacent if and only if there exists ...
Barkha Baloda +2 more
doaj +1 more source
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
Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs [PDF]
, 1979 S. Mitchell, Terry Beyer, Whitney Jones
openalex +1 more source
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
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs [PDF]
, 2007 Manuel Bodirsky +3 more
openalex +1 more source