Colored homomorphisms of colored mixed graphs

DOI10.1006/JCTB.2000.1977zbMATH Open1026.05047OpenAlexW2051774645MaRDI QIDQ1850491FDOQ1850491

Authors: J. Nešetřil, André 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

Recommendations

• On chromatic number of colored mixed graphs
• Lower bounds for the colored mixed chromatic number of some classes of graphs.
• Chromatic number of sparse colored mixed planar graphs
• Homomorphisms of planar \((m,n)\)-colored-mixed graphs to planar targets
• Oriented colorings of partial 2-trees

zbMATH Keywords

oriented chromatic numbercoloring numbercolored mixed trees

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• On acyclic colorings of planar graphs
• On the maximum average degree and the oriented chromatic number of a graph
• Good and semi-strong colorings of oriented planar graphs
• Colorings and girth of oriented planar graphs
• Acyclic and oriented chromatic numbers of graphs
• The chromatic number of oriented graphs
• The complexity of harmonious colouring for trees
• On the complexity of edge traversing
• Homomorphisms of edge-colored graphs and Coxeter groups
• On Hamilton circuits and Hamilton paths

Cited In (36)

• Colored graph homomorphisms
• The chromatic number of signed graphs with bounded maximum average degree
• Homomorphisms of 2-edge-colored graphs
• A homomorphic polynomial for oriented graphs
• Chromatic number of sparse colored mixed planar graphs
• Characterisations and examples of graph classes with bounded expansion
• Antisymmetric flows and strong colourings of oriented graphs
• Concepts of signed graph coloring
• A homology theory for colored graphs
• Homomorphisms of planar \((m,n)\)-colored-mixed graphs to planar targets
• OVERLAP COLOURINGS AND HOMOMORPHISMS OF GRAPHS
• Homomorphism-homogeneous \(L\)-colored graphs
• The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial
• Classification of edge-critical underlying absolute planar cliques for signed graphs
• On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters
• Acyclic list 7‐coloring of planar graphs
• Analogues of cliques for \((m,n)\)-colored mixed graphs
• On the 2-edge-coloured chromatic number of grids
• Homomorphism bounded classes of graphs
• Smaller universal targets for homomorphisms of edge-colored graphs
• On relative clique number of triangle-free planar colored mixed graphs
• On coloring parameters of triangle-free planar \((n, m)\)-graphs
• On the existence and non-existence of improper homomorphisms of oriented and \(2\)-edge-coloured graphs to reflexive targets
• Homomorphisms of 2-edge-colored graphs
• The recognition of bound quivers using edge-coloured homomorphisms
• Folding
• On chromatic number of colored mixed graphs
• Universal targets for homomorphisms of edge-colored graphs
• Triangle-free projective-planar graphs with diameter two: domination and characterization
• Chromatic polynomials of 2-edge-coloured graphs
• Lower bounds for the colored mixed chromatic number of some classes of graphs.
• Homomorphisms of signed graphs
• Path homomorphisms, graph colorings, and Boolean matrices
• Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor
• On clique numbers of colored mixed graphs
• Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms

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)