Homogeneously orderable graphs

DOI10.1016/S0304-3975(96)00091-6zbMath0903.68136OpenAlexW2041783376MaRDI QIDQ1392023

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

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00091-6

zbMATH Keywords

homogeneously orderable graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Subgraph trees in graph theory ⋮ Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs ⋮ On distance-preserving elimination orderings in graphs: complexity and algorithms ⋮ On compact and efficient routing in certain graph classes ⋮ Collective Additive Tree Spanners of Homogeneously Orderable Graphs ⋮ Rebuilding convex sets in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weakly triangulated graphs
• Completely separable graphs
• Distance-hereditary graphs
• Pseudo-modular graphs
• Hypergraphes arbores
• Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
• On the semi-perfect elimination
• Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
• Dominating cliques in distance-hereditary graphs

This page was built for publication: Homogeneously orderable graphs