The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests (Q1132898): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): Publication (Q5976449), #quickstatements; #temporary_batch_1710334759334 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5564135 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5510192 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Traversability and connectivity of the middle graph of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition of Finite Graphs Into Forests / rank | |||
Normal rank | |||
Revision as of 02:37, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests |
scientific article |
Statements
The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests (English)
0 references
1979
0 references
decomposition
0 references
line graph
0 references
middle graph
0 references
total graph
0 references
minimum number of line-disjoint spanning forests
0 references
Eulerian
0 references
arboricity
0 references
