Pages that link to "Item:Q987372"
From MaRDI portal
The following pages link to Comparing universal covers in polynomial time (Q987372):
Displaying 10 items.
- Computing role assignments of split graphs (Q287443) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms (Q852701) (← links)
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths (Q1343157) (← links)
- Graphs with prescribed local neighborhoods of their universal coverings (Q2312618) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
- (Q3075050) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)