cubic graph
C36670
concept
A cubic graph is a graph in which every vertex has degree exactly three, meaning each vertex is connected to exactly three edges.
All labels observed (1)
| Label | Occurrences |
|---|---|
| cubic graph canonical | 1 |
Description generation (CDg)
The one-sentence description above was generated by prompting gpt-5.1 with the class name and this instruction.
Instruction
generate a one-sentence description for a given conceptual class. # Response Format Return only the sentence: "Description: [one-sentence description of the conceptional class]"
Input
Class: cubic graph
Generated description
A cubic graph is a graph in which every vertex has degree exactly three, meaning each vertex is connected to exactly three edges.
Instances (1)
| Instance | Via concept surface |
|---|---|
| Szekeres snark | — |