A note on superbrittle graphs

DOI10.1016/0012-365X(86)90097-XzbMath0602.05035OpenAlexW1988149074MaRDI QIDQ1081614

N. V. R. Mahadev, Dominique de Werra, Myriam Preissmann

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(86)90097-x

zbMATH Keywords

superbrittle graphssuperfragile graphsvertex elimination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (16)

Quasi-brittle graphs, a new class of perfectly orderable graphs ⋮ A note on strong perfectness of graphs ⋮ Locally perfect graphs ⋮ A note on path domination ⋮ Weak bipolarizable graphs ⋮ A New Class of Brittle Graphs ⋮ On domination elimination orderings and domination graphs ⋮ A fast parallel algorithm to recognize partitionable graphs ⋮ Some aspects of the semi-perfect elimination ⋮ Path-bicolorable graphs ⋮ Sum-perfect graphs ⋮ A tree representation for \(P_ 4\)-sparse graphs ⋮ New properties of perfectly orderable graphs and strongly perfect graphs ⋮ Recognition of some perfectly orderable graph classes ⋮ On the semi-perfect elimination ⋮ Path-Bicolorable Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trivially perfect graphs
• Which line-graphs are perfectly orderable?

This page was built for publication: A note on superbrittle graphs