graph_cubic (357B)
1 # Cubic graph 2 3 A [graph] where the [degree] of each [vertex] is 3 4 5 [Petersen's_theorem]: every cubic graph without [cut_edges] has a [perfect_matching], cf Theorem 16.14 of https://faculty.etsu.edu/gardnerr/5340/notes-Bondy-Murty-GT/Bondy-Murty-GT-16-4.pdf 6 7 Up: [maximal_degree] 8 9 Aliases: cubic graph, cubic graphs 10 11 See also: [degree_3_graph], [graph_cube]