Triangulating graphs with few \(P_4\)'s
type: Item
instance of: scholarly article
title: Triangulating graphs with few \(P_4\)'s
zbMATH Open document ID: 0927.68062
DOI: 10.1016/S0166-218X(98)00115-2
author: Luitpold Babel
published in: Discrete Applied Mathematics
publication date: 1999-11-29T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1267541
zbMATH Keywords: triangulation
zbMATH Keywords: cographs
MaRDI profile type: Publication
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: On the structure of graphs with few \(P_4\)s
cites work: Q4232800
cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
cites work: The Pathwidth and Treewidth of Cographs
cites work: A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Q5501779
cites work: On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
cites work: Q3328583
cites work: Treewidth of cocomparability graphs and a new order-theoretic parameter
cites work: Hamiltonicity in graphs with few \(P_ 4\)'s
cites work: P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
cites work: On a unique tree representation for \(P_ 4\)-extendible graphs
cites work: A tree representation for \(P_ 4\)-sparse graphs
cites work: Linear time optimization algorithms for \(P_ 4\)-sparse graphs
cites work: P-Components and the Homogeneous Decomposition of Graphs
cites work: Treewidth. Computations and approximations
cites work: Q4818839
cites work: Q3686754
cites work: Q3477966
cites work: Triangulating graphs without asteroidal triples
cites work: Computing the Minimum Fill-In is NP-Complete
description: scientific article; zbMATH DE number 1267541