Primal graphs with small degrees (Q1174168): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3835500 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4294582 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3204489 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Primal graphs / rank | |||
Normal rank |
Revision as of 09:52, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Primal graphs with small degrees |
scientific article |
Statements
Primal graphs with small degrees (English)
0 references
25 June 1992
0 references
Primal graphs were introduced by \textit{A. K. Dewdney} [Aequationes Math. 4, 326--328 (1970; Zbl 0198.29106)]. It is known that there is a unique set \(\pi\) of primal graphs such that every graph has an edge-decomposition into non-isomorphic elements of \(\pi\) and that the only decomposition of an element of \(\pi\) into non-isomorphic elements of \(\pi\) is the obvious one. The authors show that there exist infinitely many elements of \(\pi\) even among graphs with a relatively simple structure.
0 references
primal graphs
0 references
edge-decompositions
0 references
isomorphism
0 references