For a given property P a reducible property R is called a minimal reducible bound for P if P ⊆ R and there is no reducible property R ′ satisfying P ⊆ R ′⊂ R .
scholar.google.com › citations
In this paper we give a survey of known reducible bounds and we prove some new minimal reducible bounds for important classes of planar graphs. This work ...
It is proved that the class of all outerplanar graphs has exactly two minimal reducible bounds in L . Some related problems for planar graphs are discussed.
Oct 22, 2024 · In this paper we give a survey of known reducible bounds and we prove some new minimal reducible bounds for important classes of planar graphs.
Minimal reducible bounds for the class of k-degenerate graphs · Read More · Minimal reducible bounds for induced-hereditary properties. Let (M^a,@?) and (L^a,@?) ...
Feb 2, 2021 · As a consequence, a lower bound on the number of maximal planar graphs is ⌈1n! (n2)(4n−11)! (3n−6)!⌉.
Sep 10, 2014 · As Emil points out, finding some exponential lower bound is easy even for highly restricted classes of graphs. If I calculated correctly, ...
Missing: reducible | Show results with:reducible
People also ask
What is the minimum number of edges in planar graph?
What is planar graph minimum cut?
What are the criteria for a planar graph?
What is the Euler's formula for planar graphs?
We consider a subclass of planar graphs, slightly wider than the class of outerplanar graphs. We prove that for this class of graphs there are infinitely ...
Nov 27, 2022 · In this paper, we prove that an optimal 1-planar graph G is reducible if and only if G is isomorphic to the complete multipartite graph K2,2,2,2 ...
Let (La; ⊆) be the lattice of hereditary and additive properties of graphs. A reducible property. R ∈ La is called minimal reducible bound for a property P ...