DeepAI AI Chat
Log In Sign Up

Are highly connected 1-planar graphs Hamiltonian?

by   Therese Biedl, et al.

It is well-known that every planar 4-connected graph has a Hamiltonian cycle. In this paper, we study the question whether every 1-planar 4-connected graph has a Hamiltonian cycle. We show that this is false in general, even for 5-connected graphs, but true if the graph has a 1-planar drawing where every region is a triangle.


page 1

page 2

page 3

page 4


On Hamiltonian-Connected and Mycielski graphs

A graph G is Hamiltonian-connected if there exists a Hamiltonian path be...

Find Subtrees of Specified Weight and Cycles of Specified Length in Linear Time

We introduce a variant of DFS which finds subtrees of specified weight i...

On the intersection graph of the disks with diameters the sides of a convex n-gon

Given a convex n-gon, we can draw n disks (called side disks) where each...

Strictly-Convex Drawings of 3-Connected Planar Graphs

Strictly-convex straight-line drawings of 3-connected planar graphs in s...

A new constraint of the Hamilton cycle algorithm

Grinberg's theorem is a necessary condition for the planar Hamilton grap...

Decomposing 4-connected planar triangulations into two trees and one path

Refining a classical proof of Whitney, we show that any 4-connected plan...

Small Connected Planar Graph with 1-Cop-Move Number 4

This paper describes a 720-vertex connected planar graph G such that cop...