Colored homomorphisms of colored mixed graphs
From MaRDI portal
(Redirected from Publication:1850491)
Recommendations
Cites work
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- Acyclic and oriented chromatic numbers of graphs
- Colorings and girth of oriented planar graphs
- Good and semi-strong colorings of oriented planar graphs
- Homomorphisms of edge-colored graphs and Coxeter groups
- On Hamilton circuits and Hamilton paths
- On acyclic colorings of planar graphs
- On the complexity of edge traversing
- On the maximum average degree and the oriented chromatic number of a graph
- The chromatic number of oriented graphs
- The complexity of harmonious colouring for trees
Cited in
(36)- On the existence and non-existence of improper homomorphisms of oriented and \(2\)-edge-coloured graphs to reflexive targets
- On clique numbers of colored mixed graphs
- Homomorphisms of planar \((m,n)\)-colored-mixed graphs to planar targets
- The chromatic number of signed graphs with bounded maximum average degree
- Folding
- Concepts of signed graph coloring
- Homomorphisms of 2-edge-colored graphs
- OVERLAP COLOURINGS AND HOMOMORPHISMS OF GRAPHS
- Acyclic list 7‐coloring of planar graphs
- Homomorphism-homogeneous \(L\)-colored graphs
- Homomorphisms of signed graphs
- On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial
- A homomorphic polynomial for oriented graphs
- Path homomorphisms, graph colorings, and Boolean matrices
- Chromatic polynomials of 2-edge-coloured graphs
- Antisymmetric flows and strong colourings of oriented graphs
- Homomorphisms of 2-edge-colored graphs
- Homomorphism bounded classes of graphs
- Classification of edge-critical underlying absolute planar cliques for signed graphs
- A homology theory for colored graphs
- On chromatic number of colored mixed graphs
- Lower bounds for the colored mixed chromatic number of some classes of graphs.
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor
- Colored graph homomorphisms
- Analogues of cliques for \((m,n)\)-colored mixed graphs
- Chromatic number of sparse colored mixed planar graphs
- On coloring parameters of triangle-free planar \((n, m)\)-graphs
- Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms
- The recognition of bound quivers using edge-coloured homomorphisms
- Characterisations and examples of graph classes with bounded expansion
- Triangle-free projective-planar graphs with diameter two: domination and characterization
- Universal targets for homomorphisms of edge-colored graphs
- Smaller universal targets for homomorphisms of edge-colored graphs
- On relative clique number of triangle-free planar colored mixed graphs
- On the 2-edge-coloured chromatic number of grids
This page was built for publication: Colored homomorphisms of colored mixed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850491)
