Colored homomorphisms of colored mixed graphs
From MaRDI portal
Publication:1850491
DOI10.1006/jctb.2000.1977zbMath1026.05047OpenAlexW2051774645MaRDI QIDQ1850491
Jaroslav Nešetřil, Andre Raspaud
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2000.1977
Related Items (28)
Homomorphism bounded classes of graphs ⋮ Acyclic list 7‐coloring of planar graphs ⋮ Unnamed Item ⋮ The chromatic number of signed graphs with bounded maximum average degree ⋮ Unnamed Item ⋮ On relative clique number of triangle-free planar colored mixed graphs ⋮ Universal targets for homomorphisms of edge-colored graphs ⋮ Analogues of cliques for \((m,n)\)-colored mixed graphs ⋮ The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial ⋮ Chromatic polynomials of 2-edge-coloured graphs ⋮ Triangle-free projective-planar graphs with diameter two: domination and characterization ⋮ A homomorphic polynomial for oriented graphs ⋮ On Chromatic Number of Colored Mixed Graphs ⋮ Concepts of signed graph coloring ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Homomorphisms of planar \((m,n)\)-colored-mixed graphs to planar targets ⋮ Homomorphisms of 2-edge-colored graphs ⋮ Homomorphisms of 2-edge-colored graphs ⋮ Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms ⋮ Folding ⋮ Smaller universal targets for homomorphisms of edge-colored graphs ⋮ On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets ⋮ Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor ⋮ The recognition of bound quivers using edge-coloured homomorphisms ⋮ Antisymmetric flows and strong colourings of oriented graphs ⋮ Chromatic number of sparse colored mixed planar graphs ⋮ On clique numbers of colored mixed graphs ⋮ Homomorphisms of Signed Graphs
Cites Work
- Unnamed Item
- On acyclic colorings of planar graphs
- Homomorphisms of edge-colored graphs and Coxeter groups
- On the maximum average degree and the oriented chromatic number of a graph
- Good and semi-strong colorings of oriented planar graphs
- The complexity of harmonious colouring for trees
- Colorings and girth of oriented planar graphs
- On Hamilton circuits and Hamilton paths
- Acyclic and oriented chromatic numbers of graphs
- On the complexity of edge traversing
- The chromatic number of oriented graphs
This page was built for publication: Colored homomorphisms of colored mixed graphs
