graph_h_minor_free (518B)
1 # H-minor-free graph 2 3 An [undirected_graph] is *H-minor-free* if it does not have an [undirected_graph] H as a [graph_minor] 4 5 Each [undirected_graph] H thus defines a [graph_family], which must be [sparse_graphs] 6 7 discussed in https://en.wikipedia.org/wiki/Graph_minor 8 9 Example: [planar_graphs] are the graphs that are {K_3, K_{5,5}}-free ([kuratowskis_theorem], [Wagners_theorem]) 10 11 Up: [graph_free] 12 13 See also: [graph_h_free] 14 15 Aliases: H minor free, minor free, H minor free graph, H minor free graphs, excluded minor