P₄-laden graphs: A new class of brittle graphs

DOI10.1016/S0020-0190(96)00134-2MaRDI QIDQ1349998zbMATH OpenFDO

Authors Vassilis Giakoumakis

Publication date 27 February 1997

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

Full work available at URL https://doi.org/10.1016/S0020-0190(96)00134-2

zbMATH Keywords

AlgorithmsBrittle graphLinear algorithmsModular decomposition

Mathematics Subject Classification ID

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

Recommendations

• A New Class of Brittle Graphs
• On the structure of graphs with few P₄s
• On the \(P_4\)-components of graphs
• On brittle graphs
• On \(P_4\)-decomposition of graphs
• Quasi-brittle graphs, a new class of perfectly orderable graphs
• Extremal \(P_4\)-stable graphs
• P₄-Decomposition of Total Graphs
• The P₄-structure of perfect graphs
• P4-decompositions of regular graphs

Cites work

• \(P_ 4\)-trees and substitution decomposition
• A New Class of Brittle Graphs
• Four classes of perfectly orderable graphs
• scientific article; zbMATH DE number 3891425 (Why is no real title available?)
• scientific article; zbMATH DE number 1375569 (Why is no real title available?)
• scientific article; zbMATH DE number 3708283 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• scientific article; zbMATH DE number 1456953 (Why is no real title available?)
• On brittle graphs
• On the complexity of recognizing perfectly orderable graphs
• Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
• Some classes of perfectly orderable graphs
• The splittance of a graph
• Transitiv orientierbare Graphen

Cited in

(18)

• On the structure of graphs with few P₄s
• \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s
• On the Grundy number of graphs with few P₄'s
• \(b\)-coloring of tight graphs
• Minimal separators in extended \(P_4\)-laden graphs
• Recognition of some perfectly orderable graph classes
• On the \(P_4\)-components of graphs
• PSPACE-hardness of two graph coloring games
• PSPACE-completeness of two graph coloring games
• On graphs with a single large Laplacian eigenvalue
• Grundy number on P₄-classes
• A New Class of Brittle Graphs
• Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
• Restricted coloring problems on graphs with few P₄'s
• On graphs with limited number of \(P_{4}\)-partners
• GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
• Finding houses and holes in graphs
• Grundy dominating sequences on X-join product

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349998)