We introduce and start the study of a bialgebra of graphs, which we call the 4-bialgebra, and of the dual bialgebra of 4-invariants. The 4-bialgebra is similar to the ring of graphs introduced by W. T. Tutte in 1946, but its structure is more complicated. The roots of the definition are in low dimen
A problem on algebraic graph theory
β Scribed by Feng Keqin
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 154 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An algebraic theory of graph factorization is introduced. For a factor h, a graph G(h) is constructod whose structure contains information about h-factorability. The l-factorable and cycle factorable graphs over Z2 are characterized, and properties of the corresponding graph G(h) are obtained.
Given two graphs G=(X,E), H=(Y,F); If AcX and if f is a function from A to Y, we pose the problem of deciding if f can be extended into a homomorphism from G to H. We know how to solve this problem when H is, for instance, a tree, or a chordal graph. We give here a solution to this problem when g is
## Abstract The aim of this note is to give an account of some recent results and state a number of conjectures concerning extremal properties of graphs.