Extending planar graph algorithms to K3,3-free graphs
نویسندگان
چکیده
منابع مشابه
Wheel-free planar graphs
A wheel is a graph formed by a chordless cycle C and a vertex u not in C that has at least three neighbors in C. We prove that every 3-connected planar graph that does not contain a wheel as an induced subgraph is either a line graph or has a clique cutset. We prove that every planar graph that does not contain a wheel as an induced subgraph is 3-colorable. AMS classification: 05C75 ∗Partially ...
متن کاملToward Practical Planar Graph Algorithms
of “ Toward Practical Planar Graph Algorithms ” by David Elliot Eisenstat, Ph.D., Brown University, May 2014 Many optimization problems involving graphs naturally feature road networks, grids, or other large planar graphs. By exploiting the special structure of planar graphs, it is often possible to design algorithms that are faster or give better results than their counterparts for general gra...
متن کاملLine graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کاملPlanar Graph Characterization - Using γ - Stable Graphs
A graph G is said to be γ stable if γ(Gxy) = γ(G), for all x, y ∈ V (G), x is not adjacent to y, where Gxy denotes the graph obtained by merging the vertices x, y. In this paper we have provided a necessary and sufficient condition for Ḡ to be γ stable, where Ḡ denotes the complement of G. We have obtained a characterization of planar graphs when G and Ḡ are γ stable graphs. Key–Words: γ stable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1990
ISSN: 0890-5401
DOI: 10.1016/0890-5401(90)90031-c