Abstract

We prove that for every d≥3d\geq 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.