Pages that link to "Item:Q2355705"

The following pages link to Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705):

Displaying 9 items.

• The complexity of two graph orientation problems (Q412352) (← links)
• Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
• The complexity of oblivious plans for orienting and distinguishing polygonal parts (Q1900891) (← links)
• Pushable chromatic number of graphs with degree constraints (Q2219941) (← links)
• Homomorphisms of planar \((m,n)\)-colored-mixed graphs to planar targets (Q2231715) (← links)
• On the pushable chromatic number of various types of grids (Q2686138) (← links)
• The complexity of deciding whether a graph admits an orientation with fixed weak diameter (Q2808534) (← links)
• On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← links)
• Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) (Q6157430) (← links)