Homomorphisms of 2-edge-colored graphs

DOI10.1016/j.dam.2009.09.017zbMath1221.05156OpenAlexW2168040452MaRDI QIDQ5901070

Amanda Montejano, Eric Sopena, Andre Raspaud, Alexandre Pinlou, Pascal Ochem

Publication date: 13 August 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.09.017

zbMATH Keywords

graph coloringhomomorphismgirthplanar graphpartial \(k\)-treeouterplanar graphmaximum average degreedischarging procedure

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (16)

The complexity of signed graph and edge-coloured graph homomorphisms ⋮ Unnamed Item ⋮ The chromatic number of signed graphs with bounded maximum average degree ⋮ On relative clique number of triangle-free planar colored mixed graphs ⋮ 2-edge-colored chromatic number of grids is at most 9 ⋮ Analogues of cliques for \((m,n)\)-colored mixed graphs ⋮ On the signed chromatic number of some classes of graphs ⋮ Injective edge-coloring of subcubic graphs ⋮ Chromatic polynomials of 2-edge-coloured graphs ⋮ On the chromatic numbers of signed triangular and hexagonal grids ⋮ Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms ⋮ Signed coloring of 2-dimensional grids ⋮ Complexity of planar signed graph homomorphisms to cycles ⋮ Chromatic number of sparse colored mixed planar graphs ⋮ Homomorphisms of Signed Graphs ⋮ Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Oriented colorings of partial 2-trees
• An oriented coloring of planar graphs with girth at least five
• 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
• Coloring the square of a \(K_{4}\)-minor free graph
• Colored homomorphisms of colored mixed graphs
• The chromatic number of oriented graphs
• Oriented graph coloring

This page was built for publication: Homomorphisms of 2-edge-colored graphs