Primal graphs with small degrees
From MaRDI portal
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.
Cites work
Cited in
(10)- The existence of infinitely many primary trees
- Primal lobsters
- On primal graphs with maximum degree 2
- scientific article; zbMATH DE number 4181369 (Why is no real title available?)
- scientific article; zbMATH DE number 4142075 (Why is no real title available?)
- scientific article; zbMATH DE number 3916315 (Why is no real title available?)
- scientific article; zbMATH DE number 4073030 (Why is no real title available?)
- scientific article; zbMATH DE number 4112651 (Why is no real title available?)
- scientific article; zbMATH DE number 734482 (Why is no real title available?)
- scientific article; zbMATH DE number 861331 (Why is no real title available?)
This page was built for publication: Primal graphs with small degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174168)