Longest paths in 2-edge-connected cubic graphs

03/06/2019
by   Nikola K. Blanchard, et al.
0

We prove almost tight bounds on the length of paths in 2-edge-connected cubic graphs. Concretely, we show that (i) every 2-edge-connected cubic graph of size n has a path of length Ω(^2n/n), and (ii) there exists a 2-edge-connected cubic graph, such that every path in the graph has length O(^2n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/29/2017

Simple cubic graphs with no short traveling salesman tour

Let tsp(G) denote the length of a shortest travelling salesman tour in a...
research
05/03/2023

Frank number and nowhere-zero flows on graphs

An edge e of a graph G is called deletable for some orientation o if the...
research
08/04/2020

Minimum maximal matchings in cubic graphs

We prove that every connected cubic graph with n vertices has a maximal ...
research
09/18/2023

Graph Threading

Inspired by artistic practices such as beadwork and himmeli, we study th...
research
03/12/2018

Counting of Shortest Paths in Cubic Grid

The enumeration of shortest paths in cubic grid is presented here. The c...
research
05/01/2019

Reconfiguring Undirected Paths

We consider problems in which a simple path of fixed length, in an undir...
research
08/22/2018

Eulerian edge refinements, geodesics, billiards and sphere coloring

A finite simple graph is called a 2-graph if all of its unit spheres S(x...

Please sign up or login with your details

Forgot password? Click here to reset