Distance-Hereditary Comparability Graphs

DOI10.1016/j.endm.2009.11.038zbMath1268.05056OpenAlexW2174221888MaRDI QIDQ2840542

Gabriele Di Stefano

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.038

zbMATH Keywords

algorithmgraph theoryrecognition algorithmsforbidden subgraphssplit decompositiontransitive orientationcompletely decomposabledistance-hereditary comparability graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Distance-hereditary comparability graphs ⋮ Distance-Hereditary Comparability Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completely separable graphs
• Non-cyclic train timetabling and comparability graphs
• Treelike comparability graphs
• Track assignment
• Distance-Hereditary Comparability Graphs
• Transforming trees by successive local complementations
• Decomposition of Directed Graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Graph Classes: A Survey
• Transitiv orientierbare Graphen
• A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs

This page was built for publication: Distance-Hereditary Comparability Graphs