Pages that link to "Item:Q1850491"
From MaRDI portal
The following pages link to Colored homomorphisms of colored mixed graphs (Q1850491):
Displayed 28 items.
- Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms (Q522969) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor (Q1045075) (← links)
- Antisymmetric flows and strong colourings of oriented graphs (Q1296157) (← links)
- On clique numbers of colored mixed graphs (Q2097162) (← links)
- The chromatic number of signed graphs with bounded maximum average degree (Q2143044) (← links)
- On relative clique number of triangle-free planar colored mixed graphs (Q2169979) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Homomorphisms of planar \((m,n)\)-colored-mixed graphs to planar targets (Q2231715) (← links)
- Homomorphism bounded classes of graphs (Q2368718) (← links)
- Universal targets for homomorphisms of edge-colored graphs (Q2407379) (← links)
- Analogues of cliques for \((m,n)\)-colored mixed graphs (Q2409513) (← links)
- Folding (Q2498742) (← links)
- The recognition of bound quivers using edge-coloured homomorphisms (Q2566139) (← links)
- Triangle-free projective-planar graphs with diameter two: domination and characterization (Q2691564) (← links)
- A homomorphic polynomial for oriented graphs (Q2692188) (← links)
- Chromatic number of sparse colored mixed planar graphs (Q2851490) (← links)
- On Chromatic Number of Colored Mixed Graphs (Q2971641) (← links)
- (Q3300693) (← links)
- Acyclic list 7‐coloring of planar graphs (Q4539872) (← links)
- On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets (Q4987273) (← links)
- (Q5206936) (← links)
- Homomorphisms of Signed Graphs (Q5265329) (← links)
- Homomorphisms of 2-edge-colored graphs (Q5900082) (← links)
- Homomorphisms of 2-edge-colored graphs (Q5901070) (← links)
- Smaller universal targets for homomorphisms of edge-colored graphs (Q5918745) (← links)
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (Q6045448) (← links)
- Chromatic polynomials of 2-edge-coloured graphs (Q6117261) (← links)