New upper bounds on the decomposability of planar graphs

2005 ◽  
Vol 51 (1) ◽  
pp. 53-81 ◽  
Author(s):  
Fedor V. Fomin ◽  
Dimitrios M. Thilikos
Keyword(s):  
2011 ◽  
Vol 28 (6) ◽  
pp. 1187-1196 ◽  
Author(s):  
Bin Liu ◽  
Gui Zhen Liu
Keyword(s):  

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Yujun Yang

The resistance distance between two vertices of a connected graphGis defined as the effective resistance between them in the corresponding electrical network constructed fromGby replacing each edge ofGwith a unit resistor. The Kirchhoff index ofGis the sum of resistance distances between all pairs of vertices. In this paper, general bounds for the Kirchhoff index are given via the independence number and the clique number, respectively. Moreover, lower and upper bounds for the Kirchhoff index of planar graphs and fullerene graphs are investigated.


10.37236/557 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Micha Sharir ◽  
Adam Sheffer

We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has led to the previous best upper bound of $43^n$ for the problem. Moreover, this new bound is useful for bounding the number of other types of planar (i.e., crossing-free) straight-line graphs on a given point set. Specifically, it can be used to derive new upper bounds for the number of planar graphs ($207.84^n$), spanning cycles ($O(68.67^n)$), spanning trees ($O(146.69^n)$), and cycle-free graphs ($O(164.17^n)$).


2013 ◽  
Vol 22 (6) ◽  
pp. 935-954 ◽  
Author(s):  
MICHA SHARIR ◽  
ADAM SHEFFER

We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have recently been used to obtain various properties of triangulations that are embedded in a fixed set of points in the plane. We generalize this method to obtain results for various other types of graphs that are embedded in the plane. Specifically, we obtain a new bound ofO*(187.53N) (where theO*(⋅) notation hides polynomial factors) for the maximum number of crossing-free straight-edge graphs that can be embedded in any specific set ofNpoints in the plane (improving upon the previous best upper bound 207.85Nin Hoffmann, Schulz, Sharir, Sheffer, Tóth and Welzl [14]). We also derive upper bounds for numbers of several other types of plane graphs (such as connected and bi-connected plane graphs), and obtain various bounds on the expected vertex-degrees in graphs that are uniformly chosen from the set of all crossing-free straight-edge graphs that can be embedded in a specific point set.We then apply the cross-graph charging-scheme method to graphs that allow certain types of crossings. Specifically, we consider graphs with no set ofkpairwise crossing edges (more commonly known ask-quasi-planar graphs). Fork=3 andk=4, we prove that, for any setSofNpoints in the plane, the number of graphs that have a straight-edgek-quasi-planar embedding overSis only exponential inN.


2021 ◽  
Author(s):  
Michał Dębski ◽  
Piotr Micek ◽  
Felix Schröder ◽  
Stefan Felsner

A vertex coloring $\phi$ of a graph $G$ is $p$-centered if for every connected subgraph $H$ of $G$ either $\phi$ uses more than $p$ colors on $H$ or there is a color that appears exactly once on $H$. Centered colorings form one of the families of parameters that allow to capture notions of sparsity of graphs: A class of graphs has bounded expansion if and only if there is a function $f$ such that for every $p\geq1$, every graph in the class admits a $p$-centered coloring using at most $f(p)$ colors. In this paper, we give upper bounds for the maximum number of colors needed in a $p$-centered coloring of graphs from several widely studied graph classes. We show that: (1) planar graphs admit $p$-centered colorings with $O(p^3\log p)$ colors where the previous bound was $O(p^{19})$; (2) bounded degree graphs admit $p$-centered colorings with $O(p)$ colors while it was conjectured that they may require exponential number of colors. All these upper bounds imply polynomial algorithms for computing the colorings. Prior to this work there were no non-trivial lower bounds known. We show that: (4) there are graphs of treewidth $t$ that require $\binom{p+t}{t}$ colors in any $p$-centered coloring. This bound matches the upper bound; (5) there are planar graphs that require $\Omega(p^2\log p)$ colors in any $p$-centered coloring. We also give asymptotically tight bounds for outerplanar graphs and planar graphs of treewidth $3$. We prove our results with various proof techniques. The upper bound for planar graphs involves an application of a recent structure theorem while the upper bound for bounded degree graphs comes from the entropy compression method. We lift the result for bounded degree graphs to graphs avoiding a fixed topological minor using the Grohe-Marx structure theorem.


10.37236/5895 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Ligang Jin ◽  
Yingli Kang ◽  
Eckhard Steffen

The only remaining case of a well known conjecture of Vizing states that there is no planar graph with maximum degree 6 and edge chromatic number 7. We introduce parameters for planar graphs,  based on the degrees of the faces, and study the question whether there are upper bounds for these parameters for planar edge-chromatic critical graphs. Our results provide upper bounds on these parameters for smallest counterexamples to Vizing's conjecture, thus providing a partial characterization of such graphs, if they exist.For $k \leq 5$ the results give insights into the structure of planar edge-chromatic critical graphs.


Filomat ◽  
2018 ◽  
Vol 32 (2) ◽  
pp. 635-642
Author(s):  
Aleksandar Savic ◽  
Zoran Maksimovic ◽  
Milena Bogdanovic

In this paper we will investigate the problem of finding the open-locating-dominating number for some classes of planar graphs - convex polytopes. We considered Dn, Tn, Bn, Cn, En and Rn classes of convex polytopes known from the literature. The exact values of open-locating-dominating number for Dn and Rn polytopes are presented, along with the upper bounds for Tn, Bn, Cn, and En polytopes.


2018 ◽  
Vol 243 ◽  
pp. 262-269 ◽  
Author(s):  
Huimin Song ◽  
Hong-Jian Lai
Keyword(s):  

1968 ◽  
Vol 11 (2) ◽  
pp. 203-211 ◽  
Author(s):  
Stephen Hedetniemi

In 1879 Kempe [5] presented what has become the most famous of all incorrect proofs of the Four Colour Conjecture, but even though his proof was erroneous his method has become quite useful. In 1890 Heawood [4] was able to modify Kempe's method to establish the Five Colour Theorem for planar graphs. In this article we show that other modifications of Kempe's method can be made which enable one to establish more results about planar graphs. By this process we obtain upper bounds for several parameters which involve partitioning the point set of a graph. In particular, we show that the point set of any planar graph can be partitioned into four or less subsets such that the subgraph induced by each subset is either disconnected or trivial (consists of a single point). We also show that the point set of any planar graph can be partitioned into three or less subsets such that the subgraph induced by each subset contains no cycles.


Sign in / Sign up

Export Citation Format

Share Document