Edge-switching homomorphisms of edge-coloured graphs
From MaRDI portal
Publication:1045035
DOI10.1016/J.DISC.2008.03.021zbMATH Open1213.05066OpenAlexW2137430154MaRDI QIDQ1045035FDOQ1045035
Timothy Graves, Richard C. Brewster
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
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
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- On the complexity of H-coloring
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- Automorphisms and enumeration of switching classes of tournaments
- SYMMETRIC HADAMARD MATRICES OF ORDER 36
- The recognition of bound quivers using edge-coloured homomorphisms
- Title not available (Why is that?)
Cited In (20)
- 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
- Title not available (Why is that?)
- On homomorphisms of oriented graphs with respect to the push operation
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial
- Switching with more than two colours.
- On the signed chromatic number of some classes of 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
- Graphs isomorphisms under edge-replacements and the family of amoebas
- On the chromatic numbers of signed triangular and hexagonal grids
- Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem
- Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$
- Homomorphisms of Signed Graphs
- Complexity of planar signed graph homomorphisms to cycles
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring
- Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar 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)
