Pages that link to "Item:Q2808534"
From MaRDI portal
The following pages link to The complexity of deciding whether a graph admits an orientation with fixed weak diameter (Q2808534):
Displaying 12 items.
- Homomorphisms and colourings of oriented graphs: an updated survey (Q279228) (← links)
- Complete oriented colourings and the oriented achromatic number (Q400508) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Research on iterative repair algorithm of hyperchaotic image based on support vector machine (Q2321679) (← links)
- Efficient extraction algorithm for local fuzzy features of dynamic images (Q2321700) (← links)
- Analogues of cliques for \((m,n)\)-colored mixed graphs (Q2409513) (← links)
- On oriented cliques with respect to push operation (Q2410221) (← links)
- Outerplanar and planar oriented cliques (Q2811201) (← links)
- (Q4414499) (← links)
- Complexity of approximating the oriented diameter of chordal graphs (Q4459604) (← links)
- Homomorphically full oriented graphs (Q6599797) (← links)
- On coloring parameters of triangle-free planar \((n, m)\)-graphs (Q6640959) (← links)
