Homomorphisms of 2-edge-colored graphs

DOI10.1016/j.endm.2008.01.007zbMath1341.05085OpenAlexW4238230664MaRDI QIDQ5900082

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

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.01.007

zbMATH Keywords

planar graphsouterplanar graphspartial 2-treespartial 3-trees

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Remarks on proper conflict-free colorings of graphs

Cites Work

• Unnamed Item
• On acyclic colorings of planar graphs
• Homomorphisms of edge-colored graphs and Coxeter groups
• Good and semi-strong colorings of oriented planar graphs
• The complexity of harmonious colouring for trees
• 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