Talk:Q1626444
Jump to navigation
Jump to search
Autodescription — cut (Q1626444)
description: in graph theory, partition of the vertices in two sets
- Useful links:
- View it! – Images depicting the item on Commons
- Report on constraint conformation of “cut” claims and statements. Constraints report for items data
For help about classification, see Wikidata:Classification.
- Parent classes (classes of items which contain this one item)
- Subclasses (classes which contain special kinds of items of this class)
- ⟨
cut⟩ on wikidata tree visualisation (external tool)(depth=1) - Generic queries for classes
- See also
- This documentation is generated using
{{Item documentation}}.
割（
Graph theory
）是圖論的一個術語，指的是將圖裡的頂點分成兩群的一種分法。 – The preceding unsigned comment was added by Waitme69 (talk • contribs) at 30 October 2015 (UTC).