Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Blanuša snarks | Statement: [Szekeres snark, isComparedWith, Blanuša snarks]

Target entity: Blanuša snarks
Context triple: [Szekeres snark, isComparedWith, Blanuša snarks]

• 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. Conway's thrackle conjecture
  Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
• D. 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.
• E. Pósa’s theorem in graph theory
  Pósa’s theorem in graph theory is a result that gives a sufficient degree condition for a finite graph to contain a Hamiltonian cycle.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Blanuša snarks
Triple: [Szekeres snark, isComparedWith, Blanuša snarks]

Blanuša snarks are early, highly symmetric examples of cubic, bridgeless graphs with edge-chromatic number four that played a key role in the study of snarks and graph coloring theory.

Target entity: Blanuša snarks
Target entity description: Blanuša snarks are early, highly symmetric examples of cubic, bridgeless graphs with edge-chromatic number four that played a key role in the study of snarks and graph coloring theory.

• 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. Conway's thrackle conjecture
  Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
• D. 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.
• E. Pósa’s theorem in graph theory
  Pósa’s theorem in graph theory is a result that gives a sufficient degree condition for a finite graph to contain a Hamiltonian cycle.
• F. None of above. chosen