47 research outputs found
The vertex leafage of chordal graphs
Every chordal graph can be represented as the intersection graph of a
collection of subtrees of a host tree, a so-called {\em tree model} of . The
leafage of a connected chordal graph is the minimum number of
leaves of the host tree of a tree model of . The vertex leafage \vl(G) is
the smallest number such that there exists a tree model of in which
every subtree has at most leaves. The leafage is a polynomially computable
parameter by the result of \cite{esa}. In this contribution, we study the
vertex leafage.
We prove for every fixed that deciding whether the vertex leafage
of a given chordal graph is at most is NP-complete by proving a stronger
result, namely that the problem is NP-complete on split graphs with vertex
leafage of at most . On the other hand, for chordal graphs of leafage at
most , we show that the vertex leafage can be calculated in time
. Finally, we prove that there exists a tree model that realizes
both the leafage and the vertex leafage of . Notably, for every path graph
, there exists a path model with leaves in the host tree and it
can be computed in time
The leafage of a chordal graph
The leafage l(G) of a chordal graph G is the minimum number of leaves of a
tree in which G has an intersection representation by subtrees. We obtain upper
and lower bounds on l(G) and compute it on special classes. The maximum of l(G)
on n-vertex graphs is n - lg n - (1/2) lg lg n + O(1). The proper leafage l*(G)
is the minimum number of leaves when no subtree may contain another; we obtain
upper and lower bounds on l*(G). Leafage equals proper leafage on claw-free
chordal graphs. We use asteroidal sets and structural properties of chordal
graphs.Comment: 19 pages, 3 figure
The Neighborhood Polynomial of Chordal Graphs
The neighborhood polynomial of a graph is the generating function of
subsets of vertices in that have a common neighbor. In this paper we study
the neighborhood polynomial and the complexity of its computation for chordal
graphs. We will show that it is \NP-hard to compute the neighborhood polynomial
on general chordal graphs. Furthermore we will introduce a parameter for
chordal graphs called anchor width and an algorithm to compute the neighborhood
polynomial which runs in polynomial time if the anchor width is polynomially
bounded. Finally we will show that we can bound the anchor width for chordal
comparability graphs and chordal graphs with bounded leafage. The leafage of a
chordal graphs is the minimum number of leaves in the host tree of a subtree
representation. In particular, interval graphs have leafage at most 2. This
shows that the anchor width of interval graphs is at most quadratic
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
The leafage of a chordal graph G is the minimum integer l such that G can berealized as an intersection graph of subtrees of a tree with l leaves. Weconsider structural parameterization by the leafage of classical domination andcut problems on chordal graphs. Fomin, Golovach, and Raymond [ESA 2018,Algorithmica 2020] proved, among other things, that Dominating Set on chordalgraphs admits an algorithm running in time . We present aconceptually much simpler algorithm that runs in time . Weextend our approach to obtain similar results for Connected Dominating Set andSteiner Tree. We then consider the two classical cut problems MultiCut withUndeletable Terminals and Multiway Cut with Undeletable Terminals. We provethat the former is W[1]-hard when parameterized by the leafage and complementthis result by presenting a simple -time algorithm. To our surprise,we find that Multiway Cut with Undeletable Terminals on chordal graphs can besolved, in contrast, in -time.<br
Unique Perfect Phylogeny Characterizations via Uniquely Representable Chordal Graphs
The perfect phylogeny problem is a classic problem in computational biology,
where we seek an unrooted phylogeny that is compatible with a set of
qualitative characters. Such a tree exists precisely when an intersection graph
associated with the character set, called the partition intersection graph, can
be triangulated using a restricted set of fill edges. Semple and Steel used the
partition intersection graph to characterize when a character set has a unique
perfect phylogeny. Bordewich, Huber, and Semple showed how to use the partition
intersection graph to find a maximum compatible set of characters. In this
paper, we build on these results, characterizing when a unique perfect
phylogeny exists for a subset of partial characters. Our characterization is
stated in terms of minimal triangulations of the partition intersection graph
that are uniquely representable, also known as ur-chordal graphs. Our
characterization is motivated by the structure of ur-chordal graphs, and the
fact that the block structure of minimal triangulations is mirrored in the
graph that has been triangulated
Equivalence of the filament and overlap graphs of subtrees of limited trees
The overlap graphs of subtrees of a tree are equivalent to subtree filament
graphs, the overlap graphs of subtrees of a star are cocomparability graphs,
and the overlap graphs of subtrees of a caterpillar are interval filament
graphs. In this paper, we show the equivalence of many more classes of subtree
overlap and subtree filament graphs, and equate them to classes of complements
of cochordal-mixed graphs. Our results generalize the previously known results
mentioned above
Recognising the overlap graphs of subtrees of restricted trees is hard
The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations. The complexity of recognising SOGs is open. The complexities of recognising many subclasses of SOGs are known. Weconsider several subclasses of SOGs by restricting the underlying tree. For a fixed integer , we consider:\begin{my_itemize} \item The overlap graphs of subtrees in a tree where that tree has leaves
\item The overlap graphs of subtrees in trees that can be derived from a given input tree by subdivision and have at least 3 leaves \item The overlap and intersection graphs of paths in a tree where that tree has maximum degree \end{my_itemize}
We show that the recognition problems of these classes are NP-complete. For all other parameters we get circle graphs, well known to be polynomially recognizable
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
The leafage of a chordal graph is the minimum integer such that can be realized as an intersection graph of subtrees of a tree with leaves.
We consider structural parameterization by the leafage of classical domination and cut problems on chordal graphs.
Fomin, Golovach, and Raymond~[ESA~, Algorithmica~] proved, among other things, that \textsc{Dominating Set} on chordal graphs admits an algorithm running in time .
We present a conceptually much simpler algorithm that runs in time .
We extend our approach to obtain similar results for \textsc{Connected Dominating Set} and \textsc{Steiner Tree}.
We then consider the two classical cut problems \textsc{MultiCut with Undeletable Terminals} and \textsc{Multiway Cut with Undeletable Terminals}.
We prove that the former is \textsf{W}[1]-hard when parameterized by the leafage and complement this result by presenting a simple -time algorithm.
To our surprise, we find that \textsc{Multiway Cut with Undeletable Terminals} on chordal graphs can be solved, in contrast, in -time
Recognising the overlap graphs of subtrees of restricted trees is hard
The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations. The complexity of recognising SOGs is open. The complexities of recognising many subclasses of SOGs are known. Weconsider several subclasses of SOGs by restricting the underlying tree. For a fixed integer , we consider:\begin{my_itemize} \item The overlap graphs of subtrees in a tree where that tree has leaves
\item The overlap graphs of subtrees in trees that can be derived from a given input tree by subdivision and have at least 3 leaves \item The overlap and intersection graphs of paths in a tree where that tree has maximum degree \end{my_itemize}
We show that the recognition problems of these classes are NP-complete. For all other parameters we get circle graphs, well known to be polynomially recognizable