Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:graph
|
| gptkbp:appliesTo |
undirected graphs
|
| gptkbp:characterizedBy |
line graphs
|
| gptkbp:defines |
A partition of the edge set of a graph into complete subgraphs such that each vertex belongs to at most two of these subgraphs.
|
| gptkbp:field |
graph theory
|
| gptkbp:namedAfter |
József Krausz
|
| gptkbp:publishedIn |
József Krausz, 1943, Mat. Fiz. Lapok
|
| gptkbp:relatedTo |
line graphs
|
| gptkbp:usedIn |
graph characterization
|
| gptkbp:bfsParent |
gptkb:Leo_Krausz
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Krausz decomposition
|