A Theorem on Planar Graphs

Cites Work

A theorem on graphs
On Hamiltonian Circuits

Cited In (only showing first 100 items - show all)

Disjoint paths, planarizing cycles, and spanning walks
Toughness in graphs -- a survey
Rotation Distance, Triangulations, and Hyperbolic Geometry
Tough graphs and Hamiltonian circuits.
Matching points with squares
A survey of the asymptotic behaviour of maps
Longest cycles in 3-connected cubic graphs
On existence theorems
Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs
Chords of longest circuits in locally planar graphs
A note on Hamiltonian cycles in planar graphs
On the obfuscation complexity of planar graphs
Dynamic graph-based search in unknown environments
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
2-connected spanning subgraphs with low maximum degree in locally planar graphs
Intersecting longest paths
Problems on pairs of trees and the four colour problem of planar graphs (extended abstract)
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
The circumference of a graph with no \(K_{3,t}\)-minor
Planar digraphs of digirth four are 2-colorable
When m vertices in a k-connected graph cannot be walked round along a simple cycle
Extending matchings in planar graphs. IV
Cycle traversability for claw-free graphs and polyhedral maps
A closure for 1-Hamilton-connectedness in claw-free graphs
Two-page book embeddings of 4-planar graphs
Polytopes, graphs, and complexes
Vertices missed by longest paths or circuits
Protecting convex sets
Greedy drawings of triangulations
Long cycles in 3-connected graphs
Long cycles through specified vertices in a graph
Bridges and Hamiltonian circuits in planar graphs
Local neighbor-distinguishing index of graphs
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
Long cycles in 4-connected planar graphs
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
Every 5-connected planar triangulation is 4-ordered Hamiltonian
The number of cycles in 2-factors of cubic graphs
On 2-connected spanning subgraphs with low maximum degree
Asymptotic dimension of planes and planar graphs
Long cycles in graphs on a fixed surface
Some remarks on Jaeger's dual-hamiltonian conjecture
Graph-theoretical conditions for inscribability and Delaunay realizability
A unified approach to visibility representations of planar graphs
Lower bounds on the cardinality of the maximum matchings of planar graphs
Hamiltonicity and colorings of arrangement graphs
Surfaces, tree-width, clique-minors, and partitions
Upper and lower bounds on long dual paths in line arrangements
The matching extendability of surfaces
Spanning closed walks and TSP in 3-connected planar graphs
On Hamiltonian cycles in 4- and 5-connected plane triangulations
Hamiltonian cycles in polyhedral maps
The smallest 2-connected cubic bipartite planar nonhamiltonian graph
Edge-disjoint Hamilton cycles in 4-regular planar graphs
Maximum bipartite subgraphs of cubic triangle-free planar graphs
Pairs of edge-disjoint Hamiltonian circuits
Every 4-connected line graph of a planar graph is Hamiltonian
Dominating plane triangulations
An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
3-trees with few vertices of degree 3 in circuit graphs
Face-width of embedded graphs
Infinite Hamilton cycles in squares of locally finite graphs
On hypohamiltonian and almost hypohamiltonian graphs
What is on his mind?
Embedding knots and links in an open book II. Bounds on arc index
Subgraphs of graphs on surfaces with high representativity
Hamilton circles in infinite planar graphs
Hamilton cycles in line graphs of 3-hypergraphs
On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs
Covering planar graphs with forests
Reconfiguration of connected graph partitions via recombination
Pairs of Hamiltonian circuits in 5-connected planar graphs
Each maximal planar graph with exactly two separating triangles is Hamiltonian
Spanning trees with nonseparating paths
Independent sets in triangle-free cubic planar graphs
4-connected projective-planar graphs are Hamiltonian-connected
Extending matchings in graphs: A survey
Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
Flips in planar graphs
Guthrie's problem: new equivalences and rapid reductions
Plane Triangulations Without Spanning 2-Trees
Lightweight paths in graphs
On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks
Alcuni sviluppi sulla teoria relativa dei singrammi finiti
Spanning Eulerian subgraphs of bounded degree in triangulations
Hamiltonian lines in infinite graphs with few vertices of smll valency
Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian
Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
Arc diagrams, flip distances, and Hamiltonian triangulations
Title not available (Why is that?)
5-Connected Toroidal Graphs are Hamiltonian-Connected
Random triangulations of the plane
Contractible Hamiltonian cycles in triangulated surfaces
Chvátal's \(t_{0}\)-tough conjecture
Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices

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)