On the \(P_4\)-components of graphs

DOI10.1016/S0166-218X(99)00114-6zbMath0942.05057WikidataQ127646903 ScholiaQ127646903MaRDI QIDQ1971221

Thomas Raschle, Klaus Simon

Publication date: 21 August 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

modular decompositionchordless path\(P_4\)-comparability graphs\(P_4\)-components\(P_4\)-indifference graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

The A4-structure of a graph ⋮ A characterization of \(P_{4}\)-comparability graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of recognizing perfectly orderable graphs
• \(P_ 4\)-comparability graphs
• On a unique tree representation for \(P_ 4\)-extendible graphs
• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
• \(P_{4}\)-laden graphs: A new class of brittle graphs
• Hamiltonicity in graphs with few \(P_ 4\)'s
• A polynomial algorithm for the parity path problem on perfectly orientable graphs
• On a property of the class of n-colorable graphs
• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• A New Class of Brittle Graphs
• Some classes of perfectly orderable graphs
• Recognizing $P_4 $-Sparse Graphs in Linear Time
• P-Components and the Homogeneous Decomposition of Graphs
• Transitiv orientierbare Graphen

This page was built for publication: On the \(P_4\)-components of graphs