graph_h_free (286B)
1 # H-free graph 2 3 An [undirected_graph] is *H-free* if it does not have an [undirected_graph] H as a [subgraph] 4 5 Each [undirected_graph] H thus defines a [graph_family] 6 7 - [triangle_free_graphs] 8 - [forbidden_subgraph_problem] 9 10 Up: [graph_free] 11 12 See also: [induced_h_free], [h_minor_free]