hasEulerianCircuitConditionUndirected
P134432
predicate
Indicates that an undirected graph satisfies the necessary and sufficient conditions to contain an Eulerian circuit (typically being connected and having all vertices of even degree).
All labels observed (1)
| Label | Occurrences |
|---|---|
| hasEulerianCircuitConditionUndirected canonical | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: hasEulerianCircuitConditionUndirected
Generated description
Indicates that an undirected graph satisfies the necessary and sufficient conditions to contain an Eulerian circuit (typically being connected and having all vertices of even degree).
Sample triples (1)
| Subject | Object |
|---|---|
| Eulerian trail | all vertices with nonzero degree have even degree and lie in a single connected component ⓘ |