Pages that link to "Item:Q1421519"

The following pages link to Homomorphisms and oriented colorings of equivalence classes of oriented graphs (Q1421519):

Displaying 28 items.

• Homomorphisms and colourings of oriented graphs: an updated survey (Q279228) (← links)
• Semigroup theory of symmetry (Q338184) (← links)
• Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms (Q522969) (← links)
• Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
• Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592) (← links)
• Sets with involutions: power group enumeration (Q976166) (← links)
• Edge-switching homomorphisms of edge-coloured graphs (Q1045035) (← links)
• Oriented incidence colourings of digraphs (Q1630937) (← links)
• A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) (← links)
• On the oriented coloring of the disjoint union of graphs (Q2115853) (← links)
• On relative clique number of triangle-free planar colored mixed graphs (Q2169979) (← links)
• Relative clique number of planar signed graphs (Q2181247) (← 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)
• Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705) (← links)
• The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
• On homomorphisms of oriented graphs with respect to the push operation (Q2397542) (← links)
• Analogues of cliques for \((m,n)\)-colored mixed graphs (Q2409513) (← links)
• On oriented cliques with respect to push operation (Q2410221) (← links)
• Digraph width measures in parameterized algorithmics (Q2442211) (← 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)
• Relative Clique Number of Planar Signed Graphs (Q2795959) (← links)
• (Q3300693) (← links)
• On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
• The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (Q6045448) (← links)
• Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) (Q6157430) (← links)