On the \(P_4\)-components of graphs
type: Item
instance of: scholarly article
title: On the \(P_4\)-components of graphs
zbMATH Open document ID: 0942.05057
DOI: 10.1016/S0166-218X(99)00114-6
author: Thomas Raschle
author: Klaus Simon
published in: Discrete Applied Mathematics
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1421668
zbMATH Keywords: chordless path
zbMATH Keywords: \(P_4\)-components
zbMATH Keywords: \(P_4\)-comparability graphs
zbMATH Keywords: \(P_4\)-indifference graphs
zbMATH Keywords: modular decomposition
MaRDI profile type: Publication
cites work: A polynomial algorithm for the parity path problem on perfectly orientable graphs
cites work: A New Class of Brittle Graphs
cites work: Q3347930
cites work: Transitiv orientierbare Graphen
cites work: \(P_{4}\)-laden graphs: A new class of brittle graphs
cites work: Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
cites work: \(P_ 4\)-comparability graphs
cites work: Some classes of perfectly orderable graphs
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: Recognizing $P_4 $-Sparse Graphs in Linear Time
cites work: P-Components and the Homogeneous Decomposition of Graphs
cites work: On the complexity of recognizing perfectly orderable graphs
cites work: Q3683903
cites work: Q3128916
cites work: Q5501778
cites work: On a property of the class of n-colorable graphs
cites work: Q4525261
Wikidata QID: Q127646903
description: scientific article; zbMATH DE number 1421668