Homogeneously orderable graphs and the Steiner tree problem

DOI10.1007/3-540-60618-1_90OpenAlexW1503908692MaRDI QIDQ6122239

Falk Nicolai, Andreas Brandstädt, Feodor F. Dragan

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60618-1_90

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Completely separable graphs
• Hypergraphes arbores
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS

This page was built for publication: Homogeneously orderable graphs and the Steiner tree problem