A Theorem on Planar Graphs

Cites work

A theorem on graphs
On Hamiltonian Circuits

Cited in

(only showing first 100 items - show all)

Matching points with squares
3-trees with few vertices of degree 3 in circuit graphs
Long cycles in 4-connected planar graphs
Maximum bipartite subgraphs of cubic triangle-free planar graphs
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
Hamiltonicity in vertex envelopes of plane cubic graphs
A survey of the asymptotic behaviour of maps
Longest cycles in 3-connected cubic graphs
A unified approach to visibility representations of planar graphs
Random triangulations of the plane
Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
On 2-connected spanning subgraphs with low maximum degree
Interval matroids and graphs
Lower bounds on the cardinality of the maximum matchings of planar graphs
On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks
Edge-disjoint Hamilton cycles in 4-regular planar graphs
The smallest 2-connected cubic bipartite planar nonhamiltonian graph
When m vertices in a k-connected graph cannot be walked round along a simple cycle
On k-path Hamiltonian maximal planar graphs
Hamiltonian triangulations and circumscribing polygons of disjoint line segments
Pairs of Hamiltonian circuits in 5-connected planar graphs
Über n-fach zusammenhängende Eckenmengen in Graphen
Pairs of edge-disjoint Hamiltonian circuits
Connectivity, genus, and the number of components in vertex-deleted subgraphs
Bridges and Hamiltonian circuits in planar graphs
Hamiltonian circuits in prisms over certain simple 3-polytopes
Metamathematical approach to proving theorems of discrete mathematics
Maximal Hamiltonian cycles in squares of graphs
Long cycles through specified vertices in a graph
On spanning subgraphs of 4-connected planar graphs
Some remarks on Jaeger's dual-hamiltonian conjecture
Small cycle double covers of 4-connected planar graphs
Extending matchings in graphs: A survey
Guarding rectangular art galleries
Spanning Eulerian subgraphs of bounded degree in triangulations
Every 4-connected line graph of a planar graph is Hamiltonian
Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete
Protecting convex sets
Graph-theoretical conditions for inscribability and Delaunay realizability
The complexity of recognizing tough cubic graphs
Tutte cycles in circuit graphs
Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs
Subgraphs of graphs on surfaces with high representativity
Hamiltonian knot projections and lengths of thick knots.
Vertices of small degree in uniquely Hamiltonian graphs
On Hamiltonian cycles in 4- and 5-connected plane triangulations
Path partitioning planar graphs of girth 4 without adjacent short cycles
Hamiltonian cycles in polyhedral maps
An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
Arc diagrams, flip distances, and Hamiltonian triangulations
Complete colorings of planar graphs
Polyhedra with few 3-cuts are Hamiltonian
Minimal \(k\)-connected non-Hamiltonian graphs
Non-Hamiltonian triangulations with distant separating triangles
Covering planar graphs with forests
An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
Surfaces, tree-width, clique-minors, and partitions
Long cycles in graphs on a fixed surface
Long cycles in 3-connected graphs
Toughness and Hamiltonicity of a class of planar graphs
Cycles in 4-connected planar graphs
Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
The circumference of a graph with no \(K_{3,t}\)-minor. II
Hamiltonian cycles in 4-connected plane triangulations with few 4-separators
4-connected polyhedra have at least a linear number of Hamiltonian cycles
Cycle spectra of contraction-critically 4-connected planar graphs
Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs
Structure and pancyclicity of maximal planar graphs with diameter two
On the Hamiltonian property hierarchy of 3-connected planar graphs
Tutte paths and long cycles in circuit graphs
Distribution of subtree sums
On 2-factors splitting an embedded graph into two plane graphs
Counting Hamiltonian cycles in planar triangulations
The \(k\)-subconnectedness of planar graphs
A survey on book-embedding of planar graphs
Hamilton cycles in line graphs of 3-hypergraphs
Characterization of \((m, n)\)-linked planar graphs
On the structure of essentially-highly-connected polyhedral graphs
Construction of Barnette graphs whose large subgraphs are non-Hamiltonian
Colored anchored visibility representations in 2D and 3D space
Cycle traversability for claw-free graphs and polyhedral maps
A counterexample to prism-Hamiltonicity of 3-connected planar graphs
Path partitioning planar graphs with restrictions on short cycles
Cycles in 5-connected triangulations
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs
Regular non-Hamiltonian polyhedral graphs
4-connected projective-planar graphs are Hamiltonian-connected
Geometric biplane graphs. II: Graph augmentation
Equivalence of Jackson's and Thomassen's conjectures
Toughness and nonhamiltonicity of polyhedral graphs
Each maximal planar graph with exactly two separating triangles is Hamiltonian
Cycles through all finite vertex sets in infinite graphs
\([a,b]\)-factors of graphs on surfaces
Prescribed edges and forbidden edges for a cycle in a planar graph
Hamilton paths in toroidal graphs
Independent sets in triangle-free cubic planar graphs
Toughness in graphs -- a survey
Tough graphs and Hamiltonian circuits. (Reprint)
Contractible Hamiltonian cycles in triangulated surfaces

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)