Distance-hereditary comparability graphs
type: Item
instance of: scholarly article
title: Distance-hereditary comparability graphs
zbMATH Open document ID: 1254.05155
author: Gabriele Di Stefano
published in: Discrete Applied Mathematics
publication date: 2012-11-22T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6109914
zbMATH Keywords: comparability graphs
zbMATH Keywords: distance-hereditary graphs
zbMATH Keywords: distance-hereditary comparability graphs
zbMATH Keywords: split decomposition
zbMATH Keywords: recognition algorithms
zbMATH Keywords: building algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2012.02.021
OpenAlex ID: W2074604981
cites work: Distance-hereditary graphs
cites work: Transforming trees by successive local complementations
cites work: A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
cites work: Graph Classes: A Survey
cites work: Non-cyclic train timetabling and comparability graphs
cites work: Graph classes between parity and distance-hereditary graphs
cites work: Compact-port routing models and applications to distance-hereditary graphs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Track assignment
cites work: Treelike comparability graphs
cites work: A Combinatorial Decomposition Theory
cites work: Decomposition of Directed Graphs
cites work: Q4470503
cites work: Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
cites work: Sources and sinks in comparability graphs
cites work: Distance-hereditary comparability graphs
cites work: A graph theoretical approach to the shunting problem
cites work: Q5708495
cites work: Transitiv orientierbare Graphen
cites work: Q3291037
cites work: Dynamic Distance Hereditary Graphs Using Split Decomposition
cites work: Completely separable graphs
cites work: Parallel concepts in graph theory
cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
cites work: Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
cites work: The rank and size of graphs
cites work: Solving some NP-complete problems using split decomposition
cites work: Q4004146
cites work: Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
DOI: 10.1016/J.DAM.2012.02.021
description: scientific article; zbMATH DE number 6109914