subcubic graph

graph where every vertex has at most 3 neighbors
Thing class_of_the_graphs_without_certain_subgraphs Q137520899
Press Enter · cited answer in seconds

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].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). subcubic graph. Retrieved May 3, 2026, from https://4ort.xyz/entity/subcubic-graph
MLA “subcubic graph.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/subcubic-graph.
BibTeX @misc{4ortxyz_subcubic-graph_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{subcubic graph}}, year = {2026}, url = {https://4ort.xyz/entity/subcubic-graph}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): subcubic graph — https://4ort.xyz/entity/subcubic-graph (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/subcubic-graph · Last refreshed: