Halin graph

In graph theory, a Halin graph is a type of planar graph, constructed by connecting the leaves of a tree into a cycle.The tree must have at least…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

We study the Optimal Linear Arrangement (OLA) problem of Halin graphs, one of the simplest classes of non-outerplanar graphs. We…

2014

We prove that the Weight Constrained Travelling Salesman Problem is NP- Complete by polynomially transforming the 0-1 Knapsack…

2014

The Strong Chromatic Index of Halin Graphs By Ziyu Hu A strong edge coloring of a graph G is an assignment of colors to the edges…

2013

Let F be any family of graphs of fixed treewidth and bounded degree. We construct a quadratic-time algorithm for calculating…

2006

A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at…

2003

In this paper, we study the problem of computing a minimum cost Steiner tree subject to a weight constraint in a Halin graph…

2001

A Halin graph the union of a tree with no degree-2 vertices and a cycle on the leaves of the tree. This paper examines the…

1994

We give a complete polyhedral characterization of the tree polytope (convex hull of the characteristic vectors of trees in the…

1985

A Halin graph is a plane graph H = T U C, where T is a plane tree with no vertex of degree two and at least one vertex of degree…

Highly Cited

1983

Highly Cited

1983

A Halin graphH=T∪C is obtained by embedding a treeT having no nodes of degree 2 in the plane, and then adding a cycleC to join…