Homomorphisms of 2-edge-colored graphs
From MaRDI portal
Recommendations
Cites work
- Colored homomorphisms of colored mixed graphs
- Good and semi-strong colorings of oriented planar graphs
- Homomorphisms of edge-colored graphs and Coxeter groups
- Lower bounds for the colored mixed chromatic number of some classes of graphs.
- On acyclic colorings of planar graphs
- Oriented graph coloring
- The chromatic number of oriented graphs
- The complexity of harmonious colouring for trees
Cited in
(13)- Edge-switching homomorphisms of edge-coloured graphs
- Homomorphisms of edge-colored graphs and Coxeter groups
- Remarks on proper conflict-free colorings of graphs
- Colored graph homomorphisms
- Edge \(k\)-to-1 homomorphisms
- The class of bipartite 2-edge-colored graphs
- Homeomorphism of 2-Complexes is Graph Isomorphism Complete
- Edge-coloured graph homomorphisms, paths, and duality
- Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms
- Homomorphisms of 2-edge-colored triangle-free planar graphs
- Homomorphism duality in edge-coloured graphs
- Homomorphisms of 2-edge-colored graphs
- Smaller universal targets for homomorphisms of edge-colored graphs
This page was built for publication: Homomorphisms of 2-edge-colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900082)