On brittle graphs
From MaRDI portal
Publication:3798703
DOI10.1002/JGT.3190120310zbMath0653.05059OpenAlexW1981227528MaRDI QIDQ3798703
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
Related Items (30)
Bipartable graphs ⋮ Lexbfs-orderings and powers of hhd-free graphs∗ ⋮ Quasi-brittle graphs, a new class of perfectly orderable graphs ⋮ An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs ⋮ \(P_{4}\)-laden graphs: A new class of brittle graphs ⋮ Locally perfect graphs ⋮ On graphs without \(P_ 5\) and \(\overline {P}_ 5\) ⋮ Weak bipolarizable graphs ⋮ Meyniel weakly triangulated graphs. II: A theorem of Dirac ⋮ Finding a sun in building-free graphs ⋮ Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs ⋮ On domination elimination orderings and domination graphs ⋮ Finding a central vertex in an HHD-free graph ⋮ Classes of perfect graphs ⋮ Completely separable graphs ⋮ Bipolarizable graphs ⋮ Meyniel weakly triangulated graphs. I: Co-perfect orderability ⋮ A charming class of perfectly orderable graphs ⋮ Which claw-free graphs are perfectly orderable? ⋮ Finding houses and holes in graphs ⋮ An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs ⋮ Recognition of some perfectly orderable graph classes ⋮ Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam ⋮ Maximum induced matching problem on hhd-free graphs ⋮ On the semi-perfect elimination ⋮ Bichromatic \(P_{4}\)-composition schemes for perfect orderability ⋮ Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and theH6-Conjecture ⋮ \(P_4\)-domination in minimal imperfect graphs ⋮ On stable cutsets in graphs ⋮ A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
Cites Work
This page was built for publication: On brittle graphs
