snark graph
C36669
concept
A snark graph is a connected, bridgeless, 3-regular graph with chromatic index 4 that serves as a minimal counterexample candidate in edge-coloring and related graph theory problems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| snark 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: snark graph
Generated description
A snark graph is a connected, bridgeless, 3-regular graph with chromatic index 4 that serves as a minimal counterexample candidate in edge-coloring and related graph theory problems.
Instances (1)
| Instance | Via concept surface |
|---|---|
| Szekeres snark | — |