Flower snark
E1182412
UNEXPLORED
The Flower snark is a well-known example of a snark graph in graph theory, notable for being a bridgeless cubic graph with chromatic index four that serves as a counterexample in edge-coloring problems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Flower snark canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T15918584 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Flower snark Context triple: [Szekeres snark, isComparedWith, Flower snark]
-
A.
Szekeres snark
The Szekeres snark is a famous cubic graph in graph theory that serves as a counterexample in edge-coloring problems and helped advance the study of snark graphs.
-
B.
Conway's 99-graph problem
Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
-
C.
Graham–Pollak theorem
The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
-
D.
Szekeres configuration
The Szekeres configuration is a notable geometric arrangement in projective geometry consisting of points and lines with specific incidence properties, studied for its combinatorial and symmetry characteristics.
-
E.
Sierpiński graph
The Sierpiński graph is a self-similar, fractal-like graph structure closely related to the Sierpiński triangle and studied in graph theory and fractal geometry.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Flower snark Target entity description: The Flower snark is a well-known example of a snark graph in graph theory, notable for being a bridgeless cubic graph with chromatic index four that serves as a counterexample in edge-coloring problems.
-
A.
Szekeres snark
The Szekeres snark is a famous cubic graph in graph theory that serves as a counterexample in edge-coloring problems and helped advance the study of snark graphs.
-
B.
Conway's 99-graph problem
Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
-
C.
Graham–Pollak theorem
The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
-
D.
Szekeres configuration
The Szekeres configuration is a notable geometric arrangement in projective geometry consisting of points and lines with specific incidence properties, studied for its combinatorial and symmetry characteristics.
-
E.
Sierpiński graph
The Sierpiński graph is a self-similar, fractal-like graph structure closely related to the Sierpiński triangle and studied in graph theory and fractal geometry.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.