The following pages link to On brittle graphs (Q3798703):
Displaying 24 items.
- Meyniel weakly triangulated graphs. I: Co-perfect orderability (Q678852) (← links)
- Which claw-free graphs are perfectly orderable? (Q686245) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- Completely separable graphs (Q908944) (← links)
- Bipolarizable graphs (Q912868) (← links)
- Bipartable graphs (Q1080439) (← links)
- Locally perfect graphs (Q1105623) (← links)
- Weak bipolarizable graphs (Q1116961) (← links)
- A charming class of perfectly orderable graphs (Q1193431) (← links)
- \(P_4\)-domination in minimal imperfect graphs (Q1293209) (← links)
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs (Q1309452) (← links)
- \(P_{4}\)-laden graphs: A new class of brittle graphs (Q1349998) (← links)
- Meyniel weakly triangulated graphs. II: A theorem of Dirac (Q1377671) (← links)
- Finding a central vertex in an HHD-free graph (Q1408816) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam (Q1814095) (← links)
- On the semi-perfect elimination (Q1825204) (← links)
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability (Q1827860) (← links)
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\) (Q1903716) (← links)
- Finding a sun in building-free graphs (Q1926049) (← links)
- Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and the<i>H</i><sub>6</sub>-Conjecture (Q5495885) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
