scispace - formally typeset
Search or ask a question
Topic

Planar graph

About: Planar graph is a research topic. Over the lifetime, 10018 publications have been published within this topic receiving 204551 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: This paper shows that a number of NP - complete problems remain NP -complete even when their domains are substantially restricted, and determines essentially the lowest possible upper bounds on node degree for which the problems remainNP -complete.

2,200 citations

Journal ArticleDOI
TL;DR: An invariant of graphs called the tree-width is introduced, and used to obtain a polynomially bounded algorithm to test if a graph has a subgraph contractible to H, where H is any fixed planar graph.

1,726 citations

Journal ArticleDOI
TL;DR: Every minor-closed class of graphs that does not contain all planar graphs has a linear-time recognition algorithm that determines whether the treewidth of G is at most at most some constant $k$ and finds a tree-decomposition of G withtreewidth at most k.
Abstract: In this paper, we give for constant $k$ a linear-time algorithm that, given a graph $G=(V,E)$, determines whether the treewidth of $G$ is at most $k$ and, if so, finds a tree-decomposition of $G$ with treewidth at most $k$. A consequence is that every minor-closed class of graphs that does not contain all planar graphs has a linear-time recognition algorithm. Another consequence is that a similar result holds when we look instead for path-decompositions with pathwidth at most some constant $k$.

1,666 citations

BookDOI
TL;DR: In this article, the authors present a classification scheme for Monocyclic systems based on the Huckel Spectrum and the Cayley Generation Functions. But they do not discuss the role of Kekule structures in chemistry.
Abstract: INTRODUCTION. ELEMENTS OF GRAPH THEORY. The Definition of a Graph. Isomorphic Graphs and Graph Automorphism. Walks, Trails, Paths, Distances and Valencies in Graphs. Subgraphs. Regular Graphs. Trees. Planar Graphs. The Story of the Koenigsberg Bridge Problem and Eulerian Graphs. Hamiltonian Graphs. Line Graphs. Vertex Coloring of a Graph. CHEMICAL GRAPHS. The Concept of a Chemical Graph. Molecular Topology. Huckel Graphs. Polyhexes and Benzenoid Graphs. Weighted Graphs. GRAPH-THEORETICAL MATRICES. The Adjacency Matrix. The Distance Matrix. THE CHARACTERISTIC POLYNOMIAL OF A GRAPH. The Definition of the Characteristic Polynomial. The Method of Sachs for Computing the Characteristic Polynomial. The Characteristic Polynomials of Some Classes of Simple Graphs. The Le Verrier-Faddeev-Frame Method for Computing the Characteristic Polynomial. TOPOLOGICAL ASPECTS OF HUECKEL THEORY. Elements of Huckel Theory. Isomorphism of Huckel Theory and Graph Spectral Theory. The Huckel Spectrum. Charge Densities and Bond Orders in Conjugated Systems. The Two-Color Problem in Huckel Theory. Eigenvalues of Linear Polyenes. Eigenvalues of Annulenes. Eigenvalues of Moebius Annulenes. A Classification Scheme for Monocyclic Systems. Total p-Electron Energy. TOPOLOGICAL RESONANCE ENERGY. Huckel Resonance Energy. Dewar Resonance Energy. The Concept of Topological Resonance Energy. Computation of the Acyclic Polynomial. Applications of the TRE Model. ENUMERATION OF KEKULE VALENCE STRUCTURES. The Role of Kekule Valence Structures in Chemistry. The Identification of Kekule Systems. Methods for the Enumeration of Kekule Structures. The Concept of Parity of Kekule Structures. THE CONJUGATED-CIRCUIT MODEL. The Concept of Conjugated Circuits. The p-Resonance Energy Expression. Selection of the Parameters. Computational Procedure. Applications of the Conjugated-Circuit Model. Parity of Conjugated Circuits. TOPOLOGICAL INDICES. Definitions of Topological Indices. The Three-Dimensional Wiener Number. ISOMER ENUMERATION. The Cayley Generation Functions. The Henze-Blair Approach. The Polya Enumeration Method. The Enumeration Method Based on the N-Tuple Code.

1,473 citations

Book
01 Jun 1979
TL;DR: A thoroughly revised second edition of Shimon Even's Graph Algorithms, with a foreword by Richard M. Karp and notes by Andrew V Goldberg, explains algorithms in a formal but simple language with a direct and intuitive presentation.
Abstract: Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search, and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.

1,428 citations


Network Information
Related Topics (5)
Chordal graph
12.8K papers, 314.2K citations
92% related
Line graph
11.5K papers, 304.1K citations
91% related
Vertex (geometry)
18.7K papers, 294.2K citations
91% related
Time complexity
36K papers, 879.5K citations
89% related
Approximation algorithm
23.9K papers, 654.3K citations
87% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20242
2023174
2022375
2021433
2020503
2019489