Pages that link to "Item:Q1272907"
From MaRDI portal
The following pages link to Homomorphisms of edge-colored graphs and Coxeter groups (Q1272907):
Displaying 35 items.
- Nonrepetitive colorings of line arrangements (Q499479) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Computing the partition function for graph homomorphisms (Q681595) (← links)
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- Homomorphisms of sparse signed graphs (Q782945) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- Computing the partition function for graph homomorphisms with multiplicities (Q889510) (← links)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- Antisymmetric flows and strong colourings of oriented graphs (Q1296157) (← links)
- Homomorphisms from sparse graphs with large girth. (Q1425115) (← links)
- Acyclic \(k\)-strong coloring of maps on surfaces (Q1581455) (← links)
- On the achromatic number of signed graphs (Q1711838) (← links)
- Colored homomorphisms of colored mixed graphs (Q1850491) (← links)
- The complexity of tropical graph homomorphisms (Q2012054) (← links)
- Complex and homomorphic chromatic number of signed planar simple graphs (Q2117521) (← links)
- On relative clique number of triangle-free planar colored mixed graphs (Q2169979) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Colored graph homomorphisms (Q2293671) (← links)
- Homomorphism bounded classes of graphs (Q2368718) (← links)
- The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
- Universal targets for homomorphisms of edge-colored graphs (Q2407379) (← links)
- Analogues of cliques for \((m,n)\)-colored mixed graphs (Q2409513) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Breaking the rhythm on graphs (Q2476277) (← links)
- Folding (Q2498742) (← links)
- The recognition of bound quivers using edge-coloured homomorphisms (Q2566139) (← links)
- On the signed chromatic number of some classes of graphs (Q2666564) (← links)
- Triangle-free projective-planar graphs with diameter two: domination and characterization (Q2691564) (← links)
- Chromatic number of sparse colored mixed planar graphs (Q2851490) (← 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)
- Homomorphisms of Signed Graphs (Q5265329) (← links)
- Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs (Q5272645) (← links)
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (Q6045448) (← links)
