On brittle graphs

DOI10.1002/JGT.3190120310zbMATH Open0653.05059OpenAlexW1981227528MaRDI QIDQ3798703FDOQ3798703

Authors: N. Khouzam, Chính T. Hoàng 

Publication date: 1988

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190120310

Recommendations

• Quasi-brittle graphs, a new class of perfectly orderable graphs
• A New Class of Brittle Graphs
• A note on strong perfectness of graphs
• On the structure of graphs with few \(P_4\)s
• Perfectly orderable graphs: A survey

zbMATH Keywords

brittle graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

• Title not available (Why is that?)

Cited In (36)

• A note on fragile graphs
• On domination elimination orderings and domination graphs
• Bipartable graphs
• Locally perfect graphs
• Finding a central vertex in an HHD-free graph
• On unstable branching graphs
• An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
• On the semi-perfect elimination
• Finding houses and holes in graphs
• Completely separable graphs
• Maximum induced matching problem on hhd-free graphs
• Weak bipolarizable graphs
• \(P_4\)-domination in minimal imperfect graphs
• Quasi-brittle graphs, a new class of perfectly orderable graphs
• Meyniel weakly triangulated graphs. I: Co-perfect orderability
• Lexbfs-orderings and powers of hhd-free graphs^∗
• Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
• A charming class of perfectly orderable graphs
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• Finding a sun in building-free graphs
• On some classes of quasi-triangulated graphs
• Meyniel weakly triangulated graphs. II: A theorem of Dirac
• Classes of perfect graphs
• Fragmentability of graphs
• An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs
• \(P_{4}\)-laden graphs: A new class of brittle graphs
• A note on strong perfectness of graphs
• Which claw-free graphs are perfectly orderable?
• Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
• Bipolarizable graphs
• Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and theH₆-Conjecture
• Bichromatic \(P_{4}\)-composition schemes for perfect orderability
• On stable cutsets in graphs
• A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
• A New Class of Brittle Graphs
• Recognition of some perfectly orderable graph classes

This page was built for publication: On brittle graphs

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