Work

Representing distance-hereditary graphs with multi-rooted trees

Year: 2025

Type: article

Abstract: Arboreal networks are a generalization of rooted trees, defined by keeping the tree-like structure, but dropping the requirement for a single root. Just as the class of cographs is precisely the class of undirected graphs that can be explained by a labelled rooted tree (T, t), we show that the class of distance-hereditary graphs is precisely the class of undirected graphs that can be explained by a labelled arboreal network (N, t).

Source: Graphs and Combinatorics

DOI: 10.1007/s00373-025-02977-8

Author: Guillaume E. Scholz

Institution: Leipzig University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,190

Funder: Universität Leipzig