non-3-edge-colorable graph
C36672
concept
A non-3-edge-colorable graph is a graph whose edges cannot be colored with just three colors so that no two adjacent edges share the same color.
All labels observed (1)
| Label | Occurrences |
|---|---|
| non-3-edge-colorable 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: non-3-edge-colorable graph
Generated description
A non-3-edge-colorable graph is a graph whose edges cannot be colored with just three colors so that no two adjacent edges share the same color.
Instances (1)
| Instance | Via concept surface |
|---|---|
| Szekeres snark | — |