Recommendations
Cited in
(36)- A note on fragile graphs
- On domination elimination orderings and domination graphs
- Simplicial vertices in graphs with no induced four-edge path or four-edge antipath, and the \(H_{6}\)-conjecture
- Bipartable graphs
- Locally perfect graphs
- Finding a central vertex in an HHD-free graph
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
- On unstable branching graphs
- On the semi-perfect elimination
- Completely separable graphs
- Finding houses and holes in 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
- Meyniel weakly triangulated graphs. II: A theorem of Dirac
- On some classes of quasi-triangulated graphs
- Classes of perfect graphs
- Fragmentability of graphs
- \(P_{4}\)-laden graphs: A new class of brittle graphs
- An \(O( n^{3})\)-time recognition algorithm for hhds-free 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
- 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
- Recognition of some perfectly orderable graph classes
- A New Class of Brittle Graphs
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)
