A Theorem on Planar Graphs

Cites work

A theorem on graphs
On Hamiltonian Circuits

Cited in

(only showing first 100 items - show all)

Flips in planar graphs
Chvátal's \(t_{0}\)-tough conjecture
Colored anchored visibility representations in 2D and 3D space
Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices
Connectivity, genus, and the number of components in vertex-deleted subgraphs
Guthrie's problem: new equivalences and rapid reductions
Criticality of counterexamples to toroidal edge-Hamiltonicity
Hamilton cycles in 4-connected troidal triangulations
A counterexample to prism-Hamiltonicity of 3-connected planar graphs
Disjoint paths, planarizing cycles, and spanning walks
Toughness in graphs -- a survey
Matching points with squares
Rotation Distance, Triangulations, and Hyperbolic Geometry
Tough graphs and Hamiltonian circuits.
A survey of the asymptotic behaviour of maps
Longest cycles in 3-connected cubic graphs
On existence theorems
On the Hamiltonian property hierarchy of 3-connected planar graphs
The number of defective colorings of graphs on surfaces
Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs
Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs
Distribution of subtree sums
Chords of longest circuits in locally planar graphs
1-Planar Graphs
Tutte paths and long cycles in circuit graphs
The \(k\)-subconnectedness of planar graphs
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs
A note on 3-connected cubic planar graphs
Regular non-Hamiltonian polyhedral graphs
Computing Tutte paths
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
Metamathematical approach to proving theorems of discrete mathematics
Maximal Hamiltonian cycles in squares of graphs
On spanning subgraphs of 4-connected planar graphs
Rooted minors and locally spanning subgraphs
Hamilton cycles in 6-connected claw-free graphs (extended abstract)
On the obfuscation complexity of planar graphs
Uniquely Hamiltonian graphs of minimum degree 4
Path partitioning planar graphs of girth 4 without adjacent short cycles
A note on Hamiltonian cycles in planar graphs
Hamiltonian triangulations and circumscribing polygons of disjoint line segments
Prescribed edges and forbidden edges for a cycle in a planar graph
Reconfiguration of connected graph partitions via recombination
Dynamic graph-based search in unknown environments
Pósa-type results for Berge hypergraphs
Complete colorings of planar graphs
Hamiltonian cycles in cubic 3-connected bipartite planar graphs
A note on traversing specified vertices in graphs embedded with large representativity
Counting cycles in planar triangulations
Minimal \(k\)-connected non-Hamiltonian graphs
Intersecting longest paths
2-connected spanning subgraphs with low maximum degree in locally planar graphs
An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
On 2-factors splitting an embedded graph into two plane graphs
Cycles through all finite vertex sets in infinite graphs
Number of Hamiltonian cycles in planar triangulations
Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
The complexity of recognizing tough cubic graphs
Über n-fach zusammenhängende Eckenmengen in Graphen
Problems on pairs of trees and the four colour problem of planar graphs (extended abstract)
Structure and pancyclicity of maximal planar graphs with diameter two
Toughness and Hamiltonicity of a class of planar graphs
Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
The circumference of a graph with no \(K_{3,t}\)-minor
Hamiltonian cycles in bipartite quadrangulations on the torus
When m vertices in a k-connected graph cannot be walked round along a simple cycle
Counting Hamiltonian cycles in planar triangulations
Guarding rectangular art galleries
Extending matchings in planar graphs. IV
Cycle traversability for claw-free graphs and polyhedral maps
Planar digraphs of digirth four are 2-colorable
Hamiltonian properties of polyhedra with few 3-cuts. A survey
A new proof that 4-connected planar graphs are Hamiltonian-connected
Path partitioning planar graphs with restrictions on short cycles
Two-page book embeddings of 4-planar graphs
Path eccentricity of graphs
Protecting convex sets
Greedy drawings of triangulations
Vertices missed by longest paths or circuits
A closure for 1-Hamilton-connectedness in claw-free graphs
Interval matroids and graphs
Long cycles in 3-connected graphs
Hamiltonian cycles in 4-connected plane triangulations with few 4-separators
Long cycles through specified vertices in a graph
Polytopes, graphs, and complexes
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
Hamiltonian cycles in 4-connected planar and projective planar triangulations with few 4-separators
Bridges and Hamiltonian circuits in planar graphs
Local neighbor-distinguishing index of graphs
Geometric biplane graphs. II: Graph augmentation
Every 5-connected planar triangulation is 4-ordered Hamiltonian
Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
Long cycles in 4-connected planar graphs
The number of cycles in 2-factors of cubic graphs
On 2-connected spanning subgraphs with low maximum degree
A survey on book-embedding of planar graphs
Find subtrees of specified weight and cycles of specified length in linear time
\(K_2\)-Hamiltonian graphs: I
Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete

This page was built for publication: A Theorem on Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3231816)