Edge-switching homomorphisms of edge-coloured graphs

DOI10.1016/J.DISC.2008.03.021MaRDI QIDQ1045035zbMATH OpenOpenAlexFDO

Authors Richard C. Brewster, Timothy Graves

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.03.021

zbMATH Keywords

homomorphismedge-coloured graphedge-switching

Mathematics Subject Classification ID

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

Recommendations

• Homomorphism duality in edge-coloured graphs
• On homomorphisms to edge-coloured cycles
• Edge-coloured graph homomorphisms, paths, and duality
• scientific article; zbMATH DE number 3901625
• Homogeneous edge-colorings of graphs
• Homomorphisms and edge-colourings of planar graphs
• Homomorphisms of 2-edge-colored graphs
• Homomorphisms of 2-edge-colored graphs
• Homomorphisms of edge-colored graphs and Coxeter groups
• Colored graph homomorphisms

Cites work

• scientific article; zbMATH DE number 2059943 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• Automorphisms and enumeration of switching classes of tournaments
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs
• On the complexity of H-coloring
• SYMMETRIC HADAMARD MATRICES OF ORDER 36
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• The recognition of bound quivers using edge-coloured homomorphisms

Cited in

(24)

• The chromatic number of signed graphs with bounded maximum average degree
• Homomorphisms of signed graphs: an update
• List homomorphism problems for signed trees
• Complexity of vertex switching on edge-bicolored graphs
• On homomorphisms of oriented graphs with respect to the push operation
• scientific article; zbMATH DE number 7559391 (Why is no real title available?)
• Switching with more than two colours.
• The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial
• On the signed chromatic number of some classes of graphs
• Homomorphisms of 2-edge-colored triangle-free planar graphs
• List homomorphisms to separable signed graphs
• The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree
• The complexity of signed graph and edge-coloured graph homomorphisms
• On the chromatic numbers of signed triangular and hexagonal grids
• Switching m-edge-coloured graphs using non-abelian groups
• Graphs isomorphisms under edge-replacements and the family of amoebas
• Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem
• Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$
• Colourings of (m, n)-coloured mixed graphs
• Complexity of planar signed graph homomorphisms to cycles
• Homomorphisms of (n,m)-graphs with respect to generalised switch
• A complexity dichotomy for signed \(\mathbf{H}\)-colouring
• Homomorphisms of signed graphs
• A dichotomy theorem for -switchable H-colouring on m-edge-coloured graphs

This page was built for publication: Edge-switching homomorphisms of edge-coloured graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045035)