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.

2019

A Halin graph is a graph obtained by embedding a tree having no nodes of degree two in the plane, and then adding a cycle to join…

2018

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

2017

For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The…

2017

A Halin graph is constructed from a plane embedding of a tree with no vertices of degree 2 by adding a cycle through its leaves…

2014

Let $T$ be a tree with no degree 2 vertices and $L(T)=\{l_1,\ldots,l_r\}, r \geq 2$ denote the set of leaves in $T$. An Halin…

2013

A Halin graph, defined by Halin [3], is a plane graph H = T ∪ C such that T is a spanning tree of H with no vertices of degree 2…

2009

According to the Hamilton property of the 3-regular Halin graph,and combined with the relations of the distance between its…

2007

2007

Finding the Hamilton path with minimum cost between two arbitrary given distinct vertices in a weighted graph,OHP for short,is a…

1994

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