\(P_{4}\)-laden graphs: A new class of brittle graphs

DOI10.1016/S0020-0190(96)00134-2zbMath0875.68475MaRDI QIDQ1349998

Vassilis Giakoumakis

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

AlgorithmsModular decompositionBrittle graphLinear algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (16)

PSPACE-hardness of two graph coloring games ⋮ On graphs with a single large Laplacian eigenvalue ⋮ PSPACE-completeness of two graph coloring games ⋮ Partitioning extended \(P_4\)-laden graphs into cliques and stable sets ⋮ On the \(P_4\)-components of graphs ⋮ GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH ⋮ Restricted coloring problems on graphs with few \(P_4\)'s ⋮ \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s ⋮ On the Grundy number of graphs with few \(P_4\)'s ⋮ \(b\)-coloring of tight graphs ⋮ Minimal separators in extended \(P_4\)-laden graphs ⋮ Finding houses and holes in graphs ⋮ Recognition of some perfectly orderable graph classes ⋮ Grundy number on -classes ⋮ Grundy dominating sequences on \(X\)-join product ⋮ ON GRAPHS WITH LIMITED NUMBER OF P₄-PARTNERS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of recognizing perfectly orderable graphs
• The splittance of a graph
• \(P_ 4\)-trees and substitution decomposition
• Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
• A New Class of Brittle Graphs
• On brittle graphs
• Four classes of perfectly orderable graphs
• Some classes of perfectly orderable graphs
• Transitiv orientierbare Graphen

This page was built for publication: \(P_{4}\)-laden graphs: A new class of brittle graphs