subcubic graph
graph where every vertex has at most 3 neighbors
Press Enter · cited answer in seconds
0 sources
subcubic graph
Summary
subcubic graph is a class of the graphs without certain subgraphs[1].
Key Facts
- subcubic graph's instance of is recorded as class of the graphs without certain subgraphs[2].
- subcubic graph's subclass of is recorded as gem-free graph[3].
- subcubic graph's subclass of is recorded as subquartic graph[4].
- subcubic graph's has characteristic is recorded as maximum vertex degree[5].
- subcubic graph's does not have part is recorded as star graph S4[6].
- subcubic graph's graphclasses.org ID is recorded as gc_720[7].