| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653505 | European Journal of Combinatorics | 2014 | 11 Pages |
Abstract
We prove that for every d≥3d≥3 the homomorphism order of the class of line graphs of finite graphs with maximal degree dd is universal. This means that every finite or countably infinite partially ordered set may be represented by line graphs of graphs with maximal degree dd ordered by the existence of a homomorphism.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jiří Fiala, Jan Hubička, Yangjing Long,