Pages that link to "Item:Q279228"
From MaRDI portal
The following pages link to Homomorphisms and colourings of oriented graphs: an updated survey (Q279228):
Displaying 40 items.
- Colourings of oriented connected cubic graphs (Q785820) (← links)
- Oriented chromatic number of Cartesian products and strong products of paths (Q1630938) (← links)
- Oriented colourings of graphs with maximum degree three and four (Q1727768) (← links)
- A study on oriented relative clique number (Q1752681) (← links)
- On the oriented coloring of the disjoint union of graphs (Q2115853) (← links)
- On fractional version of oriented coloring (Q2143042) (← links)
- Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) (Q2151213) (← links)
- On relative clique number of triangle-free planar colored mixed graphs (Q2169979) (← links)
- 2-edge-colored chromatic number of grids is at most 9 (Q2175809) (← links)
- Pushable chromatic number of graphs with degree constraints (Q2219941) (← links)
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs (Q2232245) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Signed coloring of 2-dimensional grids (Q2294442) (← links)
- Oriented cliques and colorings of graphs with low maximum degree (Q2305935) (← links)
- Chromatic polynomials of oriented graphs (Q2325756) (← links)
- On homomorphisms of oriented graphs with respect to the push operation (Q2397542) (← links)
- Orientation spectra of cubic graphs (Q2403682) (← links)
- Analogues of cliques for \((m,n)\)-colored mixed graphs (Q2409513) (← links)
- On oriented cliques with respect to push operation (Q2410221) (← links)
- Plurigraph coloring and scheduling problems (Q2628259) (← links)
- Perfect orientation colorings of cubic graphs (Q2633372) (← links)
- Coloring graphs in oriented coloring of cubic graphs (Q2674380) (← links)
- On the pushable chromatic number of various types of grids (Q2686138) (← links)
- Triangle-free projective-planar graphs with diameter two: domination and characterization (Q2691564) (← links)
- A homomorphic polynomial for oriented graphs (Q2692188) (← links)
- On Chromatic Number of Colored Mixed Graphs (Q2971641) (← links)
- (Q3300693) (← links)
- On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets (Q4987273) (← links)
- (Q5206936) (← links)
- On deeply critical oriented cliques (Q6047971) (← links)
- Equitable oriented coloring (Q6047973) (← links)
- Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) (Q6157430) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
- The oriented chromatic number of the hexagonal grid is 6 (Q6559398) (← links)
- Oriented total-coloring of oriented graphs (Q6589144) (← links)
- Homomorphically full oriented graphs (Q6599797) (← links)
- On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters (Q6611087) (← links)
- On coloring parameters of triangle-free planar \((n, m)\)-graphs (Q6640959) (← links)
- Turán problems for oriented graphs (Q6644281) (← links)
- Adding direction constraints to the 1-2-3 conjecture (Q6652479) (← links)
